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).
from collections import defaultdict
s = input()
k = int(input())
b = len(s) // k
d = defaultdict(int)
for i in s:
    d[i] += 1
if b % 2 == 0:
    f = 0
    for i in d:
        if d[i] % 2 != 0:
            f = 1
    if f == 0:
        print("YES")
    else:
        print("NO")
else:
    cnt = 0
    for i in d:
        if d[i] % 2 != 0:
            cnt += 1
    if cnt <= k:
        print("YES")
    else:
        print("NO")
