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
def palin(ss):
    if ss == ss[::-1]:
        return True
    return False
 
s = input()
t = int(input())
i = 0
arr = []
for x in range(1,len(s)):
    if i>=x:
        continue
    if palin(s[i:x+1]):
        arr.append(s[i:x+1])
        i = x+1
if len(arr)!=t:
    print("NO")
    sys.exit()
l = len(arr[0])
ans = None
for i in range(1,len(arr)):
    if len(arr[i])!=l:
        ans = "NO"
if len(arr) == t and ans==None:
    print("YES")
else:
    print("NO")

