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).
def is_palindrome(s):
    return s == s[::-1]

# Read input
s = input().strip()
k = int(input())

n = len(s)

# Check if the length of s is divisible by k
if n % k != 0:
    print("NO")
else:
    # Calculate the length of each palindromic substring
    length = n // k

    # Check each chunk of length "length" for palindromes
    for i in range(0, n, length):
        chunk = s[i:i+length]
        if not is_palindrome(chunk):
            print("NO")
            break
    else:
        print("YES")
