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
input = sys.stdin.readline

s = input()[:-1]
k = int(input())
n = len(s)
ans = 'YES'
if n % k != 0:
    print("NO")
else:
    c = n//k
    i = 0
    while i != n:
        for j in range(c//2):
            if s[i+j] != s[i + c - 1 - j]:
                ans = 'NO'
                break
        if ans == 'NO':
            break
        i += c
    print(ans)
