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()#input of string
k = int(input())#input of message
l = len(s)

#stored the length of the string
m = int(l/k) # no of message in the string

lst =[]
l2 = []
for i in range(0,l,m):
	word = s[i:i+m]
	lst.append(word)
for i in lst:
	if i == i[::-1]:
		l2.append(i)


if len(l2) == len(lst):
	print("YES")
else:
	print("NO")