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 math
def is_palindrome(s):
    for i in range(len(s) // 2):
        j = len(s) - i - 1
        if s[i] != s[j]:
            return False
    return True



def main_function():
    s = input()
    k = int(input())
    if len(s) % k != 0:
        print("NO")
    else:
        k = len(s) // k
        collector = ""
        is_answer_given = False
        for i in range(len(s)):
            collector += s[i]
            if len(collector) == k:
                if not is_palindrome(collector):
                    is_answer_given = True
                    print("NO")
                    collector = ""

        if not is_answer_given:
            print("YES")













main_function()