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 isPalindrome(s):
    if s==s[::-1]:return True
    else:return False
count=0
a=input()
b=int(input())
t=[]
for i in range(0,len(a),len(a)//b):
    t.append(a[:i])
    t.append(a[i:])
pinku=[]
pinku.append(t[-1])
pinku.append(t[-2])
# print(pinku)
for papdi in pinku:
    if isPalindrome(papdi):count+=1

# print(count)
if count==b:print('YES')
else:print('NO')


# pls hoga yaar, 2 din se correct submission nai pada