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.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class TextSplitting {
	
	public static void main(String[] args) {
		//p and q are basically two elements in a list of allowed lengths
		Scanner in = new Scanner(System.in);
		
		String initLine = in.nextLine();
		String[] initLineSplit = initLine.split(" ");
		
		int n = Integer.parseInt(initLineSplit[0]);
		int p = Integer.parseInt(initLineSplit[1]);
		int q = Integer.parseInt(initLineSplit[2]);
		
		String str = in.nextLine();
		
		// if d*p + c*q = n
		// d = (n - c*q)/p
		int c = 0;
		int d = 0;
		for (c = 0; c < n; c++){ 
			d = (n - c*q)/p;
			if (d < 0)
				continue;
			if (d*p + c*q == n)
				break;
			
		}

		
//		System.out.println(p + ": " + d);
//		System.out.println(q + ": " + c);
		
		
		if (c*q + p*d != n){
			System.out.println("-1");
			return;
		}
		
		System.out.println(d+c);
		
		int index = 0;
		for (index = 0; index < c; index++){
			System.out.println(str.substring(index * q, index * q + q));
		}
		
		int oldIndex = index*q;
		
		for(int index2 = 0; index2 < d; index2++){
			System.out.println(str.substring(oldIndex + index2 * p, oldIndex + index2 * p + p));
		}
	}
	
	
	//dfs
	/*private static ArrayList<String> solve(int n, int p, int q, String str, int start, int[] memo){
		ArrayList<String> solutions = new ArrayList<String>(); //TODO: maybe use a hashmap instead
		int diff = str.length() - start;
		if (diff  < p && diff < q){
			return ;
		}
		else if (diff == p || diff == q){
			return 
		}
		else{
			solutions = 
			if(solve(n, p, q, str, start + q, memo) != null)
				return solve();
			else if (solve(n, p, q, str, start + p, memo))
		}
		
		
//		for(int i = 0; i < n; i++){
//			if (i + p + q > n && i + p + p > n && i + q + q > n)
//				break;
//			else if (1 + p + q <= n){
//				solutions.add(str.substring(i, i+p)); //dog -> 0, 2 -> do. dog -> 1, 3 -> og
//				solutions.add(str.substring(i+p,i+p+q));
//				solutions.add(str.substring(i, i+q)); //dog -> 0, 2 -> do. dog -> 1, 3 -> og
//				solutions.add(str.substring(i+q,i+q+p));
//			}
//			else if(1 + p + p <= n){
//				solutions.add(str.substring(i, i+p)); //dog -> 0, 2 -> do. dog -> 1, 3 -> og
//				solutions.add(str.substring(i+p,i+p+p));
//			}
//			else if(1 + q + q <= n){
//				solutions.add(str.substring(i, i+q)); //dog -> 0, 2 -> do. dog -> 1, 3 -> og
//				solutions.add(str.substring(i+q,i+q+q));
//			}
//		}
//		Collections.sort(solutions);
		return solutions;
	}*/
	
	
//	
//	
//	int i = 0;
//	int j = 0;
//	boolean brk = false;
//	
//	for (i = 0; i < n; i++){
//		if (q*i == n)
//			break;
//		else if(q*i > n){
//			i--;
//			break;
//		}
//	}
//	
////	System.out.println(i);
////	System.out.println(q*i);
//	
//	if (q*i < n){
////		System.out.println("entered");
//		for (j = 0; j < n; j++){
////			System.out.println("test" + q*i);
////			System.out.println("test" + p*j);
//			if (q*i + p*j == n)
//				break;
//			else if (q*i + p*j > n)
//				break; //not possible
//		}
//	}
////	System.out.println(q*i);
////	System.out.println(p*j);
////	System.out.println(n);
////	
////	System.out.println(i);
////	System.out.println(j);
//	
//	System.out.println("start with " + q);
//	System.out.println(p + ": " + j);
//	System.out.println(q + ": " + i);
//	
//	if(q*i + p*j != n){
////		System.out.println("entered2");
//		//repeat but with p first
//		
//		for (j = 0; j < n; j++){
//			if (p*j == n)
//				break;
//			else if(p*j > n){
//				j--;
//				break;
//			}
//		}
////		System.out.println(j);
//		
//		if (p*j < n){
//			for (i = 0; i < n; i++){
//				if (q*i + p*j == n)
//					break;
//				else if (q*i + p*j > n)
//					break;
//			}
//		}
//	}

}
