While Mike was walking in the subway, all the stuff in his back-bag dropped on the ground. There were several fax messages among them. He concatenated these strings in some order and now he has string *s*.

He is not sure if this is his own back-bag or someone else's. He remembered that there were exactly *k* messages in his own bag, each was a palindrome string and all those strings had the same length.

He asked you to help him and tell him if he has worn his own back-bag. Check if the given string *s* is a concatenation of *k* palindromes of the same length.
The first line of input contains string *s* containing lowercase English letters (1 ≤ |*s*| ≤ 1000).

The second line contains integer *k* (1 ≤ *k* ≤ 1000).
import java.util.*;
public class mikeAndFax {
	public static boolean isPalindrome(String x){
	    if(x.length()==1 || x.length()==0)
	    	return true;
	    else{
	    if(x.charAt(0)==x.charAt(x.length()-1))
	    	return isPalindrome(x.substring(1,x.length()-1));
	   	else
	    	return false;
	   }
	}
    public static void main(String[] args){
    	Scanner sc= new Scanner(System.in);
    	String x =sc.nextLine();
    	int k =sc.nextInt();
    	int w = x.length();
    	int o =0;
    	int i =2;
    	int count =0;
    	while(i<=x.length()){
    		if(isPalindrome(x.substring(0,i))){
    			o=x.length();
    			x=x.substring(i);
    			i=1;
    			count++;
    				}
    		i++;
    		}

    		if(count==k&&(count*o)==w)
    				System.out.println("YES");
    		else
    			System.out.println("NO");

    }
}