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 fileinput import *

for line in input():
    if lineno() == 1:
        s = line.strip()
    if lineno() == 2:
        n = int(line.strip())

sl = len(s)
unit_length = sl // n

newlist = []

for i in range(n):
    newlist.append(s[i*unit_length:i*unit_length+unit_length])


def is_p(word):
    return word == word[::-1]

res = True
for word in newlist:
    if is_p(word):
        pass
    else:
        res = False
        break

if res and sl % n == 0:
    print('YES')
else:
    print('NO')
