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 esPalindromo(palabra,nroLetras):
	i = 0
	j = nroLetras - 1
	espal = True
	while j > i:
		if palabra[j] != palabra[i]:
			espal = False
			break
		i += 1
		j -= 1
	return espal

contenidos = input()
nroMensajes = int(input())
nroLetras = len(contenidos)//nroMensajes

if nroLetras*nroMensajes != len(contenidos):
	print("NO")
else:
	i = 0
	todosson = True
	while i < len(contenidos):
		todosson = todosson and esPalindromo(contenidos[i:i+nroLetras],nroLetras)
		i += nroLetras
	if todosson:
		print("YES")
	else:
		print("NO")
