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).
def isPan(L, l, r):

    for i in range(0, (r - l) // 2 + 1):
        if L[l + i] != L[r - i]:
            return False
    return True

S = list(input())
k = int(input())
length = len(S) // k
f = 1
for i in range(k):
    if not isPan(S, length*i, length*(i+1) - 1):
        f = 0
        break
    
if f:
    print("YES")
else:
    print("NO")
    
    