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).
class CodeforcesTask548ASolution:
    def __init__(self):
        self.result = ''
        self.conc = ''
        self.k = 0

    def read_input(self):
        self.conc = input()
        self.k = int(input())

    def process_task(self):
        if len(self.conc) % self.k:
            self.result = "NO"
        else:
            c_ = True
            nl = len(self.conc) // self.k
            for x in range(self.k):
                for y in range(nl):
                    if self.conc[x * nl + y] != self.conc[(x + 1) * nl - y - 1]:
                        c_ = False
                        break
                if not c_:
                    break
            self.result = "YES" if c_ else "NO"

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask548ASolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
