A - Mike and Fax

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

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 kpalindromes of the same length.

Input

The first line of input contains string s containing lowercase English letters (1 ≤ |s| ≤ 1000).

The second line contains integer k (1 ≤ k ≤ 1000).

Output

Print "YES"(without quotes) if he has worn his own back-bag or "NO"(without quotes) otherwise.

Sample Input

Input

saba
2

Output

NO

Input

saddastavvat
2

Output

YES

Hint

Palindrome is a string reading the same forward and backward.

In the second sample, the faxes in his back-bag can be "saddas" and "tavvat".

判断等长回文串个数。

附AC代码：

 #include<iostream>
 #include<cstring>
 #include<algorithm>
 using namespace std;

 int main(){
     string s;
     int n;
     cin>>s;
     cin>>n;
     int flag=;
     if(s.size()%n){
         cout<<"NO"<<endl;
     }
     else{
         int len=s.size();
         int t=len/n;
         for(int i=;i<len;i+=t){
             for(int j=i;j<(i+t/);j++){
                 if(s[j]!=s[i+t--j+i]){
                     flag=;
                     break;
                 }
             }
         }
         if(flag){
             cout<<"NO"<<endl;
         }
         else{
             cout<<"YES"<<endl;
         }
     }
     return ;
 }