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 main():
    str = input()
    k_first_symbols = len(str)
    k_letters = int(input())
    if len(str) % k_letters != 0:
        print('NO')
    else:
        polindrom_list = []
        for x in range(int(k_letters)):
            polindrom_list.append(str[0:int(k_first_symbols / k_letters)])
            str = str[int(k_first_symbols / k_letters): len(str)]
        all_polindromes = True
        for x in polindrom_list:
            rev_x = x[::-1]
            if x != rev_x:
                all_polindromes = False
        if (all_polindromes):
            print("YES")
        else:
            print("NO")

if __name__ == "__main__":
    main()
