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.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class Main {
  public static void main (String[] args) {
    
   int a,b;
   String str;

   Scanner sc = new Scanner (System.in);
   a=sc.nextInt();
   b=sc.nextInt();
   str=sc.next();    

   Pattern p = Pattern.compile("^[0-9]{"+a+"}-[0-9]{"+b+"}");
   Matcher m = p.matcher(str);
   if (m.find()) {
	System.out.println("Yes");
   } else {
 	System.out.println("No");
   }

  }
}