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()
k=int(input())
if len(s)%k!=0:
    print("NO")
    exit(0)
else:
    m=len(s)//k
    for i in range(k):
        f=1
        for j in range(i*m,i*m+m-m//2):
            if s[j]!=s[(i+1)*m-f]:
                print("NO")
                exit(0)
            f+=1
print("YES")