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();
		boolean ans = true;
		String s = sc.next();
		char c[] = s.toCharArray();
		for (int i = 0; i <= s.length() - 1; i++) {
			if (i == a && c[i] != '-') {
				ans = false;

			}

			if (i != a) {
				if (c[i] != '0' && c[i] != '1' && c[i] != '2' && c[i] != '3'
						&& c[i] != '4' && c[i] != '5' && c[i] != '6'
						&& c[i] != '7' && c[i] != '8' && c[i] != '9') {
					ans = false;
				}
			}
		}
		if(s.length()!=a+b+1){
			ans=false;
		}

if(ans){
	System.out.println("Yes");
}else{
	System.out.println("No");
}
	}
}