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).
import math

buffer = input()
buffer2 = int(input())
size = int(len(buffer)/buffer2)
sema = 0
size2 = int(size/2)
for i in range(0,size):
    left = buffer[i*size:i*size+size2]
    right = buffer[i*size+size2:i*size+size]
    right = right[::-1]
    if(left != right):
        sema =1 

if(sema ==1 ):
    print('NO')
else:
    print("YES")