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).
string = str(input())
n = int(input())
upd = int(len(string) / n)
output, p = 1, 0
while p < len(string):
    p1, p2 = p, p + upd - 1
    while p1 < p2:
        if string[p1] != string[p2]:
            output = 0
            break
        p1 += 1
        p2 -= 1
    p += upd
if output == 0:
    print("NO")
else:
    print("YES")
