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 sys
a = input()
a = list(a)
k = int(input())
if len(a)%k != 0:
    print('NO')
    sys.exit()
na = []
j = 0
h = int(len(a)/k - 1)
c = int(len(a)/k)
for i in range(k):
    na.append(a[j:h+1])
    j = h+1
    h += c
u = 9999
g = 0
f = int(len(na[0])/2)
for i in range(len(na)):
    l = len(na[i])
    for j in range(l//2):
        if na[i][j] != na[i][-1-j]:
            u = u
            
        else:
            g+=1
            

ng = g//f
if ng == k:
    print('YES')
else:
    print('NO')
    
    
    
