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
function main() {

    var arr = readline().split(' ').map(Number);

    var n = arr[0],
        p = arr[1],
        q = arr[2];

    var str = readline();


    var flag=false;

    for (var i = 0; i <= n; i++) {
        for (var j = 0; j <= n; j++) {
            if ((i * p + j * q) == n) {
                print(i+j);
                var m;
                for(m=0;m<i;m++){
                    print(str.slice(p*m,p*(m+1)));
                }
                for(var n=0;n<j;n++){
                    print(str.slice(q*n+p*m,q*(n+1)+p*m));
                }
                flag=true;
                return;
            }
        }
    }

    if(flag==false){
        print(-1);
    }

}

main();