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 stdin=new Scanner(System.in);
		int  a=stdin.nextInt();
		int  b=stdin.nextInt();
		String s=stdin.next();
		char c[]=s.toCharArray();
		int flag=0;
//		for(int i=0;i<c.length;i++)
//			System.out.println(c[i]);

		if(a>5 || b>5){
			//			System.out.println("No");
			flag=1;
		}
		if(c[a]!='-' || c.length!=a+b+1){
			//			System.out.println("No");
			flag=1;
		}
		for(int i=0;i<a;i++){
			if(c[i]=='-')
				flag=1;
		}
		for(int i=a+1;i<a+b+1;i++){
			if(c[i]=='-')
				flag=1;
		}


		if(flag==1)
			System.out.println("No");
		else if(flag!=1)
			System.out.println("Yes");
	}
}