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).
s = input()
k = int(input())


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

    return True


def find_all_palind_with_len(s, k):
    count = 0
    for i in range(0, len(s) - k):
        # print(s[i:i + k])
        if is_palind(s[i:i + k]):
            count += 1


    return count


flag = False
# find_all_palind_with_len(s, 6)
for i in range(len(s), 2, -1):
    if find_all_palind_with_len(s, i) == k:
        flag = True

if flag:
    print("YES")
else:
    print("NO")

 	 					 				   		  				   		