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
import javax.xml.soap.Text;
import java.util.Scanner;

/**
 * Created by danielmckee on 3/12/16.
 */
public class TextSplitting {
    private Scanner in = new Scanner(System.in);
    private int n;
    private int p;
    private int q;
    private String s;


    private void solve() {
        // multiples of p and q
        // x * p + y * q = target length
        int x = 0;
        int y = 0;
        // loop through multiples of first number see if difference is divisible by second number
        while (x*p <= n) {
            int part = n - x*p;
            if ( part % q == 0) {
                y = part / q;
                printResult(x, y);
                return;
            }
            x ++;
        }
        System.out.println("-1");
    }

    private void printResult(int x, int y) {
        int startIdx = 0;
        System.out.println(x+y);
        for (int i = 0; i < x; i++) {
            System.out.println(s.substring(startIdx, startIdx+p));
            startIdx += p;
        }
        for (int i = 0; i < y; i ++) {
            System.out.println(s.substring(startIdx, startIdx+q));
            startIdx += q;
        }
    }


    private void readInput(){
        n = in.nextInt();
        p = in.nextInt();
        q = in.nextInt();
        s = in.next();
    }

    public static void main(String[] args){
        TextSplitting t = new TextSplitting();
        t.readInput();
        t.solve();
    }
}
