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 palindrome(a):
    if len(a)==1 or len(a)==0:
        return 1
    elif len(a)==2:
        if a[0]==a[1]:
            return 1
        else:
            return 0
    else:
        if a[0]==a[len(a)-1]:
            return palindrome(a[1:len(a)-1])
        else:
            return 0
flag=0
s=input()
k=int(input())
l=int((len(s))/k)
for i in range(1,k+1):
    if not palindrome(s[i*l-l:i*l]):
        print("NO")
        flag=1
        break
if flag==0:
    print("YES")
