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).
import sys
s=input()
k=int(input())

def palin(n):
    for x in range(len(n)//2):
        if n[x]!=n[len(n)-1-x]:
            return False
    return True    

if len(s)%k==0:
    l=(len(s)//k)
else:
    print('NO')
    sys.exit(0)
x=0
l_1=l
while True:
    if palin(s[x:l_1]):
        x+=l
        l_1+=l
        #print(l_1)
        #print(x,l)
        if l_1== len(s):
            print('YES')
            break
    else:
        print('NO')
        break
        
    
        
