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).
# include <iostream>
# include <algorithm> 
using namespace std;
long long i,k; string q,p,s;
int main()
{
	cin>>s>>k;
	if (s.length()%k!=0) { cout<<"NO"; return 0; }
	k=s.length()/k;
	for (i=0;i<s.length();i++)
	{
		p=p+s[i];
		if ((i+1)%k==0)
		{
			q=p;
			reverse(p.begin(),p.end());
			if (q!=p) { cout<<"NO"; return 0; }
			p="";
		}
	}
	cout<<"YES";
}