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()
n=int(input())
def palli(s):
    l=len(s)
    for i in range (l):
        if s[i]!=s[l-i-1]:
            return 0
        else:
            return 1



l=len(s)
count=0
i=0
while(i<l):
    for j in range(i+2,l+1):
        
        
        if palli(s[i:j])==1:
             
             count+=1
             i=j
             j=i+2
             break
    else:
        i+=1
    


if count==n:
    print('yes')
else:
    print('no')
            
                 
        
    
        
