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).
a = input()
b = int(input())
def A(x):
    for i in range(int(len(x)/2)):
        if x[i]!=x[-1-i]:
            return False
    return True
if len(a)%b != 0:print('NO')
else:
    j = 1
    flag = 1
    for i in range(0,len(a),len(a)//b):
        flag *= A(a[i:(len(a)//b)*j])
        j+=1
    if flag == 0:print('NO')
    else:print('YES')

				     		   	  	 	  	  			  	