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 pal(s, start, end):
    l = len(s)
    while(start < end):
        if(s[start] == s[end]):
            start = start +1
            end = end -1
        else:
            break
        
def mike(s, a):
    t = len(s)/a
    start = 0
    end = t - 1
    while(a > 0):
        if(pal(s, start, end)):
            start = end + 1
            end = start + t -1
        else:
            return("NO")
    return("YES")
    
s = input()
a = int(input())
print(mike(s, a))
   
    