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 isPlaindrome(expression):
    if(len(expression) <= 1):
        return True
    else:
        if(expression[len(expression)-1] == expression[0]):
            return isPlaindrome(expression[1:(len(expression)-1)])
        else:
            return False

s = input()
k = int(input())

l = len(s)//k

count = 0

b = False

i = 0

while i < len(s):
    b = isPlaindrome(s[i:i+l])
    if(b):
        count += 1
    i += l
    
if count == k:
    print("YES")
else:
    print("NO")