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).
n = input()
nn = int(input())

lenn = len(n)
i,c,cc=0,0,0

while i<lenn:
	a = n.find(n[i])
	aa=n.find(n[i],a+1)
	ab,aab = a,aa

	for j in range(a,aa+1):
		if n[ab]==n[aab]:
			c = 1
		if ab > aab:
			break
		ab,aab = ab+1,aab-1
	if c==1:
		cc += 1
		i=aa
	i = i+1
	c = 0
if cc==nn:
	print("YES")
else:
	print("NO")