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.*;

// ARC 86-D
// https://beta.atcoder.jp/contests/arc086/tasks/arc086_b

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		
		int A = in.nextInt();
		int B = in.nextInt();
		String s = in.next();
		
		boolean isValid = true;
		if (s.length() != A + B + 1) {
			isValid = false;
		}
		if (s.charAt(A) != '-') {
			isValid = false;
		}
		for (int i = 0; i < s.length(); i++) {
			if (i != A && !('0' <= s.charAt(i) && s.charAt(i) <= '9')) {
				isValid = false;
			}
		}
		System.out.println(isValid ? "Yes" : "No");
	}
}
