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;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int A = sc.nextInt(); int B = sc.nextInt();
		String string = sc.next();
		for(int i=0;i<A;i++) 
			if('0' > string.charAt(i)  || '9' < string.charAt(i)) 
				{
					System.out.println("No"); 
					System.exit(0);
				}
		
		if(string.charAt(A)  != '-') 
			{
				System.out.println("No");
				System.exit(0);
			}
		
		for(int i=A+1;i<A+B;i++) 
			if('0' > string.charAt(i)  || '9' < string.charAt(i)) 
				{
					System.out.println("No"); 
					System.exit(0);
				}
		System.out.println("Yes");
	}

}
