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).
s = input()
k = int(input())
plen = len(s)/k

def pal(ss):
    be, en = 0, len(ss)-1
    while be<en:
        if ss[be]!=ss[en]:
            return False
        be += 1
        en += 1
    return True

def test_msg(ss):
    be = 0
    en = plen
    while en<=len(s):
        if not pal(ss[be:en]):
            return False
        be += plen
        en += plen
    return True

if test_msg(s):
    print('YES')
else:
    print('NO')
