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 java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.lang.StringBuilder;
import java.util.Stack;

public class Main {
    
    public static void main(String[] args) throws IOException{
        
        InputReader reader = new InputReader();
        
        int n = reader.nextInt();
        int p = reader.nextInt();
        int q = reader.nextInt();
        String input = reader.nextLine();

        int a = 0;
        int b = 0;
        boolean loop = true;
        for(int i = 0; i <= n && loop; i++) {
            for(int j = 0; j <= n && loop; j++) {
                if(i*p + q*j == n) {
                    loop = false;
                    a = i;
                    b = j;
                }
            }
        }

        if(loop) {
            System.out.println("-1");
        } else {
            System.out.println(a + b);
            for(int i = 0; i < a; i ++) {
                System.out.println(input.substring(0, p));
                input = input.substring(p);
            }
            for(int j = 0; j < b; j++) {
                System.out.println(input.substring(0, q));
                input = input.substring(q);
            }

        }
            

    }

}




class InputReader{
    private BufferedReader reader;
    private StringTokenizer tokenizer;

    public InputReader() {
        tokenizer = null;
        reader = new BufferedReader(new InputStreamReader(System.in));
    }

    public InputReader(String fileName) throws FileNotFoundException{
        tokenizer = null;
        reader = new BufferedReader(new FileReader(fileName));
    }

    public String nextLine() throws IOException{
        return reader.readLine();
    }

    public String next() {
        while ( tokenizer == null || !tokenizer.hasMoreTokens() ) {
            try {
                tokenizer = new StringTokenizer(nextLine());
            } catch( IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public long nextLong() {
        return Long.parseLong(next());
    }
}