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).
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import time

def polytest(str):
    flag = True
    for i in range(divmod(len(str),2)[0]):
        if str[i] != str[-i-1]:
            flag = False
            break
    return flag

str = input()
k   = int(input())

start = time.time()
dm = divmod(len(str), k)

if dm[1] != 0:
    ans = "NO"
else:
    for i in range(k):
        ans = "YES"
        if polytest(str[i*dm[0]: (i+1)*dm[0]]) == False:
            ans="NO"
            break

print(ans)
finish = time.time()
#print (finish - start), "sec"
