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;
import java.lang.Math;

public class main {
	private static Scanner s;
	public static void main(String[] args) {
		s=new Scanner(System.in);
		int n=s.nextInt();
		int p=s.nextInt();
		int q=s.nextInt();
		s.nextLine();
		String text = s.nextLine();
		char[] decoText=text.toCharArray();
		
		int minimo=Math.min(p,q);
		int mayor=Math.max(p, q);
		int [] nums=new int[n/minimo];
		
		int cont=0;
		
		
		int i, size = 0;
		if(n==p+q) {
			System.out.println("2");
			for (i = 0; i < p; i++) {
				System.out.print(decoText[i]);
			}
			System.out.println("");
			for ( ; i <n ; i++) {
				System.out.print(decoText[i]);
			}
		}else if(n%p==0 || n%q==0) {
			if(n%p==0) size=p;
			else if(n%q==0) size=q;
			
			System.out.print(n/size);
			
			
			for (int j = 0; j < (n/size); j++) {
				System.out.println("");
//				System.out.println(j);
				for (int k=0; k < size; k++) {
					System.out.print(decoText[cont]);
					cont++;
				}
			}
		}else {
			int divGrande=0; 
			int divMin=0;
			int aux=0;
			boolean found=false;
			String numerote= new String();
			int j;
			for (int l = 0; l < n/minimo && aux!=n; l++) {
				numerote= " ";
				divGrande=0;
				divMin=0;
				aux=0;		
				for (int h = 0; h < l; h++) {
					numerote+= "14";
					aux+=mayor;
					divGrande++;
				}
				for (int h = 0; h < n-l && aux!=n ; h++) {
					numerote+= "3";
//						System.out.println(numerote);
					aux+=minimo;
					if(aux==n) found=true;
					divMin++;

//					System.out.println(aux+" "+divGrande+" "+divMin+ " "+ n);			
				}	
			}
			if(found) {
				cont=0;
				System.out.println(divGrande+divMin);
				for (int j1 = 0; j1 < divGrande; j1++) {
					for (int k=0; k < mayor; k++) {
						System.out.print(decoText[cont]);
						cont++;
					}
					System.out.println("");
				}
				for (int j1 = 0; j1 < divMin; j1++) {
//					System.out.println(j);
					for (int k=0; k < minimo; k++) {
						System.out.print(decoText[cont]);
						cont++;
					}
					System.out.println("");
				}
			}else {
				System.out.println("-1");	
			}
		}	
	}
}
