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.*;
//import static java.lang.Integer.*;
import static java.lang.Long.*;
import static java.lang.Math.*;
import static java.lang.System.*;

public class Main {
	public static void main(String[] args) {
		int i,j;
		Scanner sc = new Scanner(in);
		long a = parseLong(sc.next());
		long b = parseLong(sc.next());
		char[] s = sc.next().toCharArray();
		sc.close();
		boolean f=true;
		for (i = 0; i < a; i++) {
			if(s[i] < '0' || '9' < s[i]) {
				f=false;
				break;
			}
		}
		if(f && s[i] != '-') {
			f=false;
		}
		if(f) {
			i++;
			for (; i < a+b+1; i++) {
				if(s[i] < '0' || '9' < s[i]) {
					f=false;
					break;
				}
			}
		}
		out.println(f?"Yes":"No");
	}
}
