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).
a = input()
n = int(input())
l = len(a) // n
f = False
k = 0
p = []
for i in range(n):
  p.append(a[k : k + l :])
  k += l
for t in range(len(p)):
    for i in range(l // 2):
       if p[t][i] != p[t][l - i - 1]:
           f = True
           break
    if f:
       print('NO')
       break
if not f and len(a) % n == 0:
   print('YES')
elif len(a) % n != 0:
   print('NO')
  
  
   
   
