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) {
	Main m = new Main();
	m.answer();
    }

    private Scanner scan = new Scanner(System.in);
    private int A;
    private int B;
    private String S;

    public Main() {
	A = Integer.parseInt(scan.next());
	B = Integer.parseInt(scan.next());
	S = scan.next();

	scan.close();
    }

    public final void answer() {

	String ans = "Yes";

	for (int i = 0; i < A+B+1; i++) {

	    if(i == A) {
		if(S.charAt(i) != '-') {
		    ans = "No";
		    break;
		}
		
	    } else {
		int d = S.charAt(i) - '0';
		if(d < 0 || d > 9) {
		    ans = "No";
		    break;
		}
	    }
	}

	System.out.println(ans);
	
    }
}
