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())
s1=len(s)
def pal(s,s1):
    if(s1%2==0):
        s2=s1//2
    else:
        s2=s1//2+1
    k=0
    for i in range(s2):
        if(s[i]==s[s1-i-1]):
            k+=1
        else:
            break
    if(k==s2):
        return 1
    else:
        return 0
m=0
if(s1%k==0):
    s2=len(s)//k
    for i in range(s1):
        if(i%s2==0):
            s3=s[i:i+s2]
            if(pal(s3,s2)==1):
                m+=1
            else:
                break
else:
    m=0

if(m==k):
    print("YES")
else:
    print("NO")



