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).
# -*- coding: utf-8 -*-
"""
Created on Sun May 26 18:12:28 2019

@author: avina
"""

def isPalindrome(s): 
      
    rev = ''.join(reversed(s)) 
    if (s == rev): 
        return True
    return False

s = input()
n = int(input())
d = 0;k = len(s)
e = s[0]
a= 0
i = 1
while i <k:
    if e == s[i]:
        if isPalindrome(s[a:i+1]):
            d+=1
        if i+1 < k:
            e = s[i+1]
        a = i+1
        i+=2
        
    else:
        i+=1
if d==n:
    print('YES')
else:
    print('NO')