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).
"""
Nombre: Gaspar Hermán

Fecha: 20/6/2016

Descripcion: Problema 548A de Codeforces
"""
# Ingreso de datos
palabra = input()  # Palabra que contiene k palindromos de tamaño k
k = input()
k = int(k)  # Se trata como un entero en lugar de un texto
contador = True  # Con esto verificamos la condicion de palindromo
s = 0

k3 = len(palabra) // k  # Esto se tiene que hacer ya que python hace division con flotantes

for i in range(k):
	b = palabra[s:k3]  # Sacam
	b2 = b[::-1]

	if b != b2:
		contador = False
		break

	else:
		s = k3
		k3 = k3 + k3

# Verificacion de palindromo
if contador:
	print("YES")

else:
	print("NO")	