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.Scanner;

public class Acm {
	public static void main(String args[]){
		Scanner sc= new Scanner(System.in);
		
		String s  =sc.next();
		int k=sc.nextInt();boolean b= true; 
		if(s.length() %k !=0)
			b=false ;
		for(int i=0 ; i<s.length() &&b ;i+=s.length()/k){
			if(!ispalindorm(s.substring(i, i+s.length()/k)))
			{
				b= false ;
			}
			
			
			
		}
		if(b)System.out.println("Yes"); else System.out.println("No");
		
		
		
		
		
	
		
	}
	public static boolean ispalindorm(String s){
		int i =0 ; int j = s.length()-1; 
		while(i!=j && i-j!=1){
			if(s.charAt(i)!=s.charAt(j)) return false ;
			i++;j--;
			
			
			
		}
		return true;
		
	}
	
	
	
	
	
	
	

}
// 1000