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
from sys import stdin, stdout
from math import sqrt
from fractions import gcd

def splitstring(a, b, p, q, s):
    return (str(a+b)+'\n'+
            '\n'.join([s[i*p:(i+1)*p] for i in xrange(0, a)]+
                      [s[a*p+j*q:a*p+(j+1)*q] for j in xrange(0, b)]))

def solve((n, p, q), s):
    g = gcd(p,q)
    if n%g:
        return "-1\n"
    a = n/p
    b = 0
    while a >= 0:
        w = a*p+b*q
        if w > n:
            a -= 1
        elif w < n:
            b += 1
        else:
            return splitstring(a, b, p, q, s)
    return "-1\n"

def main():
    lines = stdin.readlines()
    v = [int(val) for val in lines[0].strip().split(' ')]
    s = lines[1].strip()
    stdout.write(solve(v, s))
    
main()
