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).
#! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=utf-8
#
# Copyright © 2015 missingdays <missingdays@missingdays>
#
# Distributed under terms of the MIT license.

"""

"""

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

def check(l):
    for elem in l:
        if not pali(elem):
            return False
    return True    


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

l = [s[i:i+k] for i in range(0, len(s)//k+1, k)]

yes = check(l)

if yes and len(s) % k == 0:
    print("YES")
else:
    print("NO")
