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();
		String code = sc.next();

		System.out.println(isCorrectPostalCode(code, A, B));

	}

	public static String isCorrectPostalCode(String code, int A, int B) {

		char[] codes = code.toCharArray();
		if (codes[A] != '-') {
			return "No";
		}

		String[] postalCodeList = code.split("-", 0);
		if (postalCodeList.length != 2) {
			return "No";
		}
		if (postalCodeList[0].length() != A || postalCodeList[1].length() != B) {
			return "No";
		}

		return "Yes";
	}
}
