The postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen `-`, and the other characters are digits from `0` through `9`.

You are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.

Constraints

* 1≤A,B≤5
* |S|=A+B+1
* S consists of `-` and digits from `0` through `9`.

Input

Input is given from Standard Input in the following format:


A B
S


Output

Print `Yes` if S follows the postal code format in AtCoder Kingdom; print `No` otherwise.

Examples

Input

3 4
269-6650


Output

Yes


Input

1 1
---


Output

No


Input

1 2
7444


Output

No
import java.util.*;

public class Main {
  public static void main(String[] args) throws Exception {
    
    Scanner sc = new Scanner(System.in);
    int A = sc.nextInt();
    int B = sc.nextInt();
    String S = sc.next();
    if (S.length() != A + B + 1){
      System.out.println("No");
    }
    String case1 = S.substring(0, A);
    char case2 = S.charAt(A);
    String case3 = S.substring(A+1);
 
    if (!case1.matches("[0-9]*")) {
      System.out.println("No");
      return;
    }
    if (case2 != '-') {
      System.out.println("No");
      return;
    }
    if (case3.matches("[0-9]*")) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }
  }
}
    