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.util.Scanner;
public class TextSplitting {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		String input1 = scan.nextLine();
		String[] respuestas = input1.split(" ");
		int n = Integer.parseInt(respuestas[0]);
		int p = Integer.parseInt(respuestas[1]);
		int q = Integer.parseInt(respuestas[2]);
		String palabra =scan.nextLine();
		String[] salida2 = new String[n*n];	
		int correcto = 0;
		int numero = 0;

		if(p == n && q == n){
			for(int i=0;i<n;i++){
				salida2[0] = palabra;
				numero++;
			}
			correcto++;
		}
		if(p + q == n){
			correcto++;
			String[] salida = new String[n];
			salida[0] = palabra.substring(0,p);
			salida[1] = palabra.substring(p,palabra.length()); 
			salida2[0] = salida[0];
			salida2[1] = salida[1];
			numero = 2;
			}else if(n%p == 0){
				correcto++;
				String[] salida = new String[n*n];
				int cont = 0;
				boolean cond = false;
				int x = 0;
				for(int i=0;i<salida.length;i++){
					if(i*p == n){
						x = i;
						cond = true;
 					}else{
 						x = x;
 						cond = cond;
 					}
 					if(cond == true){
 						salida[i] = palabra.substring(cont,p+cont);
 						salida2[i] = salida[i];
 						cont = cont + n/x;
 						numero++;
 						if(cont >= n){
 							break;
 						}
 					}
				}
			}else if(n%q == 0){
				correcto++;
				String[] salida = new String[n*n];
				int cont = 0;
				boolean cond = false;
				int x = 0;
				for(int i=0;i<salida.length;i++){
					if(i*q == n){
						x = i;
						cond = true;
 					}else{
 						x = x;
 						cond = cond;
 					}
 					if(cond == true){
 						salida[i] = palabra.substring(cont,q+cont);
 						salida2[i] = salida[i];
 						cont = cont + n/x;
 						numero++;
 						if(cont >= n){
 							break;
 						}
 					}
				}
			}else if(n%(p+q) == 0){
				correcto++;
				int r = p+q;
				String[] salida = new String[n*n];
				int cont = 0;
				boolean cond = false;
				int x = 0;
				for(int i=0;i<salida.length;i++){
					if(i*r == n){
						x = i;
						cond = true;
 					}else{
 						x = x;
 						cond = cond;
 					}
 					if(cond == true){
 						salida[i] = palabra.substring(cont,r+cont);
 						salida2[i] = salida[i];
 						cont = cont + n/x;
 						numero++;
 						if(cont >= n){
 							break;
 						}
 					}
				}
			}else{
				boolean stop = false;
				for(int i=0;i<n*n;i++){
					for (int j=0;j<n*n;j++) {
						if(p*j + q*i == n){
							String[] salida = new String[n*n];
							int cont = 0;
							int cont1=0;
							boolean cond = false;
								while(cont < j){
									salida[cont] = palabra.substring(cont1,p+cont1);
 									salida2[cont] = salida[cont];
 									numero++;
 									cont1 = cont1 + p;
 									cont++;
								}
								while(cont<(j+i)){
									salida[cont] = palabra.substring(cont1,q+cont1);
 									salida2[cont] = salida[cont];
 									numero++;
 									cont1 = cont1 + q;
 									cont++;
								}	
							correcto++;	
							stop = true;
							break;
						}
						if(stop == true){
							break;
						}
					}
				}
			}

		if(correcto == 0 ){
			System.out.println("-1");
		}else{
			System.out.println(numero);
			for(int i=0;i<salida2.length;i++){
				if(salida2[i] != null){
					System.out.println(salida2[i]);
				}
			}
		}
	}
}
