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.*;
// warm-up
// Have to check the post hyphen string for digit as well.
public class Main {

	static void solve() {
		Scanner sc = new Scanner(System.in);
		int A = sc.nextInt(), B = sc.nextInt(), i=A+1;
		String s = sc.next();
		boolean ok = s.charAt(A)=='-';
		if (ok) while (i<A+B+1) ok&=Character.isDigit(s.charAt(i++));
		i=0;
		if (ok) while (i<A) ok&=Character.isDigit(s.charAt(i++));
		System.out.println(ok ? "Yes" : "No");
		sc.close();		
	}

	public static void main(String args[]) {
		solve();
	}

}