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;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		int b = sc.nextInt();
		String s = sc.next();
		
		String s2 = s.substring(0, a);
		String s3 = s.substring(a, a + 1);
		String s4 = s.substring(a + 1);
		
		
 
        // 正規表現のパターンを作成
        Pattern p = Pattern.compile("^[0-9]+$");
        Matcher m = p.matcher(s2);
        Matcher m2 = p.matcher(s4);
 
        if (m.find() && s3.equals("-") && m2.find()) System.out.println("Yes");
        else System.out.println("No");
        
	}
}