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).
s = input()
n = int(input())
k = 0
def ma(a):
    m = ""
    for i in range(len(a)):
        m+=a[len(a)-i-1]
    return m
def pal(a):
    if a==ma(a):
        return 1
    return 0
def gasht(s,n):
    m = 0
    for i in range(len(s)-n+1):
        m+=pal(s[i:i+n])
    return m
for i in range(1,1+len(s)):
    num = gasht(s,i)
    if num==n:
        print(i)
        print("YES")
        k = 1
        break
if k != 1:
    print("NO")
