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.*;
public class TheTextSplitting{
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n, p, q, p2 = 0, contador = 0, contador2 = 0, extra = 0, sumador = 1, ayuda = 0;
		String s, prim = "", seg = "";
		n = in.nextInt();
		p = in.nextInt();
		q = in.nextInt();
		s = in.next();
		if((n % p) == 0){
			contador = n / p;
			int b = 0;
			System.out.println(contador);
			for(int i = 0; i < contador; i++){
				System.out.println(s.substring(b, b + p));
				b = b + p;
			}		
		}
		else if((n % q) == 0){
			contador = n / q;
			System.out.println(contador);
			int b = 0;
			for(int i = 0; i < contador; i++){
				System.out.println(s.substring(b, b + q));
				b = b + q;
			}
		}
		else{
			for(int i = n; i>= q; i -= p){
				n = n - p;
				if(n % q == 0){
					extra = n / q;
					break;
				}
				sumador++;
			}
			if(extra > 0){
				contador = extra + sumador;
				contador2 = p;
				System.out.println(contador);
				for(int i = 0; i < contador; i++){
					System.out.println(s.substring(p2,contador2));
					if((s.length() - contador2) % q != 0){ 	
						p2 = contador2;	
						contador2 = contador2 + p;	
					}
					else{
						p2 = contador2;
						contador2 = contador2 + q;
					}
				}
			}
			else{
				contador = -1;
				System.out.println(contador);
			}
		}
	}
}