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).
def chunks(l, n):
  for i in range(0, len(l), n):
    yield l[i:i+n]

def palindrome(s):
  for i in range(len(s)):
    if s[i] != s[-(i+1)]:
      return False
  else:
    return True

import sys
data, num = sys.stdin.readlines()
data = data.strip()
num = int(num.strip())


if num > len(data):
  print("NO")
elif num == len(data):
  print("YES")
else:
  if len(data) % num == 0:
    for c in chunks(data, int(len(data)/num)):
      if not palindrome(c):
        print("NO")
        sys.exit()
    else:
      print("YES")
  else:
    print("NO")
