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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Collections;
import java.util.LinkedList;
import java.util.StringTokenizer;
import java.util.TreeSet;


public class TheTextSplitting {

	public static void main(String[] args){
		// Use BufferedReader rather than RandomAccessFile; it's much faster
	    BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
	                                                  // input file name goes above
	    PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
	    // Use StringTokenizer vs. readLine/split -- lots faster
	    StringTokenizer st = null;
	   
							  // Get line, break into tokens
	    
	   //enter program here
	    long startTime = System.currentTimeMillis();
	    try {
			st = new StringTokenizer(f.readLine());
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	    int n = Integer.parseInt(st.nextToken());
	    int p = Integer.parseInt(st.nextToken());
	    int q = Integer.parseInt(st.nextToken());
	    try {
			st = new StringTokenizer(f.readLine());
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	    String str = st.nextToken();
	    
	    
	    int values[] = new int[n];
	    //int source[] = new int[n];
	    
	    values[p-1] = p;
	    values[q-1] = q;
	    
	    for (int i = 0; i<n-1; i++){
	    	if (values[i]!=0){
	    		try{
	    		values[i+p] = i+1;}catch(Exception e){};
	    		try{
	    		values[i+q] = i+1;}catch(Exception e){};
	    	}
	    }
	    
	    
	    //System.out.println(values[n-1]);
	    //for (int i = 0; i<n; i++){
	    //	System.out.println(values[i]);
	    //}
	    int counter = 0;
	    String answer = "";
	    if (values[n-1] == 0){
	    	answer = "-1";
	    }else{
	    	
	    	int curr = n;
	    	int source = values[curr-1];
	    	while (source!=curr){
	    		answer = (str.substring(curr-(curr-source), curr))+"\n"+answer;
	    		counter +=1;
	    		curr = source;
	    		source = values[curr-1];
	    	}
	    	//System.out.println(curr+" "+source);
	    	if (curr!=0){
	    	answer = (str.substring(0, curr))+"\n"+answer;
	    	counter +=1;
	    	}
	    }
	    if (!answer.equals("-1"))
	    answer = counter +"\n"+answer;
	    System.out.println(answer.trim());
	    
	    //System.out.println(System.currentTimeMillis()-startTime);
	    // answer output

    	out.close();	    
	    System.exit(0);                     
	}
}
