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 concenated_palindrome {

    public static void main(String args[])
    {
        Scanner s = new Scanner(System.in);
        String str = s.next();
        int k = s.nextInt();
        System.out.println(solve(str,k));
    }
    private static String solve(String str,int k)
    {
        int total_strings = 0;
        for(int i=0;i<str.length();i++)
        {
            for(int j=i+1;j<str.length();j++)
            {
                if(str.charAt(i)==str.charAt(j) && is_a_palindrome(str,i,j))
                {
                    total_strings++;
                    i = j;
                    break;
                }
            }
        }
        return (total_strings==k)?"YES":"NO";
    }
    private static boolean is_a_palindrome(String str,int x,int y)
    {
        while(x<y) {
            if(str.charAt(x)!=str.charAt(y)) return false;
            x++;
            y--;
        }
        return true;
    }
}
