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).
al = 'abcdefghijklmnopqrstuvwxyz'
count = [0] * 26
s = input()
for c in s:
    count[al.index(c)]+=1
k = int(input())
#print (sum([x for x in count if not x%2 and x!=0]))
su = sum([x for x in count if not x%2 and x!=0])
if not su%k and su>k and not count.count(1) % k and all([x <= 2 or not x%2 for x in count]):
    print ('YES')
else:
    print ('NO')