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 is_pol(s, l, i):
    seq = s[i: i + l]
    for i in range(int(l/2)):
        if not seq[i] == seq[-i - 1]:
            return False
    return True


s = input()
k = int(input())

length = len(s)
small_length = int(length/k)
for i in range(0, length, small_length):
    if not is_pol(s, small_length, i):
        print('NO')
        break
else:
    print('YES')
		 	    	 		 		 			 				 	  	