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.util.ArrayList;
public class Main{

	private static Scanner entrada = new Scanner(System.in);

	public static void main(String[] args) {

		String numeros = entrada.nextLine();
		String texto = entrada.nextLine();

		ArrayList<Integer> espacios = new ArrayList<Integer>();
		for(int i = 0; i < numeros.length(); i++)
			if(numeros.charAt(i) == ' ')
				espacios.add(i);

		int n = Integer.parseInt(numeros.substring(0, espacios.get(0)));
		int p = Integer.parseInt(numeros.substring(espacios.get(0)+1, espacios.get(1)));
		int q = Integer.parseInt(numeros.substring(espacios.get(1)+1, numeros.length()));


		int divP = 0;
		int divQ = 0;
		boolean solucion = false;

		for(divP = 0; divP <= 100; divP++){
			for(divQ= 0; divQ <= 100; divQ++){

				if((p*divP + q*divQ) > n)
					break;

				if((p*divP + q*divQ) == n){
					solucion = true;
					break;
				}
			}
			if(solucion)
				break;
		}

		if(!solucion){
			System.out.println("-1");
			System.exit(0);
		}

		System.out.println(divP + divQ);

		int indice = 0;
		for(int i = 0; i < divP; i++){
			System.out.println(texto.substring(indice, indice+p));
			indice += p;
		}

		for(int i = 0; i < divQ; i++){
			System.out.println(texto.substring(indice, indice+q));
			indice += q;
		}

		
	}

}