You are given the string s of length n and the numbers p, q. Split the string s to pieces of length p and q.

For example, the string "Hello" for p = 2, q = 3 can be split to the two strings "Hel" and "lo" or to the two strings "He" and "llo".

Note it is allowed to split the string s to the strings only of length p or to the strings only of length q (see the second sample test).

Input

The first line contains three positive integers n, p, q (1 ≤ p, q ≤ n ≤ 100).

The second line contains the string s consists of lowercase and uppercase latin letters and digits.

Output

If it's impossible to split the string s to the strings of length p and q print the only number "-1".

Otherwise in the first line print integer k — the number of strings in partition of s.

Each of the next k lines should contain the strings in partition. Each string should be of the length p or q. The string should be in order of their appearing in string s — from left to right.

If there are several solutions print any of them.

Examples

Input

5 2 3
Hello


Output

2
He
llo


Input

10 9 5
Codeforces


Output

2
Codef
orces


Input

6 4 5
Privet


Output

-1


Input

8 1 1
abacabac


Output

8
a
b
a
c
a
b
a
c
def printLetters(word):
    for l in word:
        print(l)
def printSegments(word, size):
    print(int(len(word)/ size))
    for i in range(0, int(len(word) / size)):
        print(word[i * size: i*size + size])

def split(word, a, b):
    index = 0
    size = len(word[index:])
    words = []
    while size % b != 0:
        words.append(word[index:index+a])
        index += a
        size = len(word[index:])
    if size < b:
        print(-1)
        return
    if size == 0:
        print(len(words))
        for w in words:
            print(w)
        return
    while index < len(word):
        words.append(word[index:index+b])
        index += b
    print(len(words))
    for w in words:
        print(w)
        
    
def divide(word, n, p, q):
    if p > n and q > n:
        print(-1)
        return
    if p == 1 or q == 1:
        print(n)
        printLetters(word)
        return
    if n % p == 0:
        printSegments(word, p)
        return
    if n % q == 0:
        printSegments(word, q)
        return

    if p < q:
        split(word, p, q)
    else:
        split(word, q, p)
    

l = input().split()
n = int(l[0])
p = int(l[1])
q = int(l[2])
word = input()

divide(word, n, p, q)
