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()
s=list(s)
p=int(input())
f=0
#lst = list(map(int, input().strip().split(' ')))
i=0
k=len(s)//p
while(i<=len(s)-k):
    t=[]
    for j in range(i,i+k):
        t.append(s[j])

    if s[i:i+k]==t[::-1]:
        i+=k 
        
    else:
        print('NO')
        f=1
        break
if f==0:
    print('YES')