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;
import math
import time
import random
import functools

def pal(x):
    for i in range(len(x)//2):
        if x[i] != x[len(x) - i - 1]:
            return False
    return True

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

l = 0
if len(s)%k == 0:
    l = len(s)//k
else:
    print("NO")
    exit(0)

for i in range(k):
    q = ""
    for j in range(l*i, l*i+l):
        q+=s[j]
    if not pal(q):
        print("NO")
        exit(0)

print("YES")