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 sys import stdin,stdout
ii1 = lambda: int(stdin.readline().strip())
is1 = lambda: stdin.readline().strip()
iia = lambda : list(map(int, stdin.readline().strip().split()))
isa = lambda: stdin.readline().strip().split()

s = is1()
k = ii1()
d= {}
for i in s:
    d.setdefault(i, [0])[0] += 1
tot = len(s) // k
if k % 2 == 0:
    for i in d:
        if d[i][0] % 2 != 0:
            print("NO")
            break
    else:
        print("YES")
else:
    req = 2
    temp = False
    for i in d:
        if d[i][0] % req != 0:
            if not temp and d[i][0] == tot:
                temp = True
                continue
            else:
                print("NO")
                break
    else:
        print("YES")
        


    

