#include <bits/stdc++.h>
int main() {
  int i, j, l, n, flag, k1, k2, k;
  char str[1010];
  while (~scanf("%s", str)) {
    flag = 0;
    scanf("%d", &n);
    getchar();
    l = strlen(str);
    if (l % n != 0) {
      printf("NO\n");
      continue;
    }
    if (l == n) {
      printf("YES\n");
      continue;
    }
    k = l / n;
    if (l % n == 0) {
      for (i = 0; i < n; i++) {
        if (k % 2 == 0) {
          for (k1 = i * k + (k / 2) - 1, k2 = i * k + (k / 2);
               k1 >= i * k, k2 < (i + 1) * k; k1--, k2++) {
            if (str[k1] != str[k2]) {
              flag = 1;
              break;
            }
          }
        }
        if (k % 2 == 1) {
          for (k1 = i * k + (k / 2) - 1, k2 = i * k + (k / 2) + 1;
               k1 >= i * k, k2 < (i + 1) * k; k1--, k2++) {
            if (str[k1] != str[k2]) {
              flag = 1;
              break;
            }
          }
        }
        if (flag == 1) break;
      }
      if (flag == 1)
        printf("NO\n");
      else
        printf("YES\n");
    }
  }
  return 0;
}

### Prompt

Develop a solution in Cpp to the problem described below:

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>
int main() {
  int i, j, l, n, flag, k1, k2, k;
  char str[1010];
  while (~scanf("%s", str)) {
    flag = 0;
    scanf("%d", &n);
    getchar();
    l = strlen(str);
    if (l % n != 0) {
      printf("NO\n");
      continue;
    }
    if (l == n) {
      printf("YES\n");
      continue;
    }
    k = l / n;
    if (l % n == 0) {
      for (i = 0; i < n; i++) {
        if (k % 2 == 0) {
          for (k1 = i * k + (k / 2) - 1, k2 = i * k + (k / 2);
               k1 >= i * k, k2 < (i + 1) * k; k1--, k2++) {
            if (str[k1] != str[k2]) {
              flag = 1;
              break;
            }
          }
        }
        if (k % 2 == 1) {
          for (k1 = i * k + (k / 2) - 1, k2 = i * k + (k / 2) + 1;
               k1 >= i * k, k2 < (i + 1) * k; k1--, k2++) {
            if (str[k1] != str[k2]) {
              flag = 1;
              break;
            }
          }
        }
        if (flag == 1) break;
      }
      if (flag == 1)
        printf("NO\n");
      else
        printf("YES\n");
    }
  }
  return 0;
}

```