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=list(input())
n=int(input())
if len(s)%n==0:
     r=int(len(s)/n)
     for q in range(n-1):
          q+=1
          s.insert(q+r+s.count(" ")-1," ")
ans="YES"
for s2 in ''.join(s).split(" "):
     s1=list(s2)
     s1.reverse()
     if s2!=''.join(s1):
          ans="NO"
print(ans)
