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()
l=len(s)
n=int(input())
if(l%n!=0):
    print("NO")
else:
    a=0
    fla=1
    k=l/n
    for i in range(n):
        l1=[]
        for i in range(a,int(k)):
            l1.append(s[i])
        print("L! hai",l1)
        if(l1!=list(reversed(l1))):
            fla=0
            print("hua:")
            break
        else:
            a=int(k)
            k*=2
            
    if(fla==1):
        print("YES")
    else:
        print("NO")
        