#include <bits/stdc++.h>
using namespace std;
int n, i, k, b, a = 0;
string s, s1, s2;
double c;
int main() {
  cin >> s >> n;
  c = s.size() % n;
  if (c) {
    cout << "NO";
    return 0;
  }
  k = s.size() / n;
  b = k;
  for (i = 0; i < n; i++) {
    s1 = s.substr(a, b);
    a += k;
    s2 = s1;
    reverse(s2.begin(), s2.end());
    if (s1 != s2) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES";
}

### Prompt

Construct a cpp code solution to the problem outlined:

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.

<image>

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.

Examples

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int n, i, k, b, a = 0;
string s, s1, s2;
double c;
int main() {
  cin >> s >> n;
  c = s.size() % n;
  if (c) {
    cout << "NO";
    return 0;
  }
  k = s.size() / n;
  b = k;
  for (i = 0; i < n; i++) {
    s1 = s.substr(a, b);
    a += k;
    s2 = s1;
    reverse(s2.begin(), s2.end());
    if (s1 != s2) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES";
}

```