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=raw_input()
list_s=[]
for i in s:
	list_s.append(i)
flag=True
k=raw_input()

size_s= len(list_s)/int(k)
k=int(k)
if ( (len(list_s) % k) != 0 ):
	flag=False

A=[]
k=0
for i in range(0,k):
	A[i]=[]
	for j in range(0,size_s):
		A[i].append(list_s[k])
		k=k+1

for l in range(0,k):
	temp=A[l]
	revtemp=temp
	revtemp.reverse()
	if list(temp) == list(revtemp):
		continue
	else:
		flag=False

if flag is True:
	print "YES"
else:
	print "NO"

	
