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 palindrome(word):
    for i in range (len(word)//2):
        if(word[i]!=word[len(word)-i-1]):
           return False
    return True
    
word = input()
num = int(input())
check = True
length=len(word)/num
a = int(0)
b = int(a+length)
if(len(word)%num != 0):
    print("NO")
    check = False
print(a, b)
while (check and a<len(word)-1):
    check = palindrome(word[a:b])
    if not(check):
        print("NO")
        break;
    a, b = int(b), int(b+length)
    
if (check):
    print("YES")