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).
s, n = input(), int(input())
sz = len(s)

if sz % n:
  print("NO")
  exit(0)

sub_strings = [s[i : i + sz // n] for i in range(0, sz, sz // n)]

for sub_str in sub_strings:
  left, right = 0, len(sub_str) - 1
  while left < right:
    if sub_str[left] != sub_str[right]:
      print("NO")
      exit(0)
    left += 1
    right -= 1

print("YES")