Codeforces Round #305 (Div. 2)--A. Mike and Fax

判断回文串的程序，注意每个串的长度要求一致。然后一个串一个串的检查是不是回文串就好了。

#include<cstdio>
#include<cstdlib>
#include<string>
#include<iostream>
#include<string.h>

using namespace std;

char s[2000];

int main()
{

    int n;
    cin>>s>>n;
    int len = strlen(s);
    if( len % n != 0)
    {
        cout<<"NO"<<endl;
        return 0;
    }
    int j = 0;
    for(int i = 0 ; i < n; i++ )
    {
        for(int k = 0; k < len / n  ; k++)
        {
            if(s[j+k] != s[j + (len / n) -1 -k])
            {
                cout<<"NO"<<endl;
                return 0;
            }
        }
        j+=len / n;
    }
    cout<<"YES"<<endl;
    return 0;

}

A. Mike and Fax

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

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 test(s)

Input

saba
2

Output

NO

Input

saddastavvat
2

Output

YES

Note

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".