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 TheTextSplit{
	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		int length=in.nextInt();
		int p=in.nextInt();
		int q=in.nextInt();
		int result=0;
		int resultAux=0;
		int aux=0;
		int worst=0;
		int counterP=1;
		int countQ=0;
		String word=in.next();
		if(length%(p+q)==0 && p!=q){
			int correr=length/(p+q);
			result=length/(p+q)*2;
			resultAux=p;
			System.out.println(result);

			for(int i=0; i<correr; i++){
				System.out.println(word.substring(aux,resultAux));
				aux=resultAux;
				resultAux=resultAux+q;
				System.out.println(word.substring(aux,resultAux));
				aux=resultAux;
				resultAux=resultAux+p;
			}
		}
		else if(length%p==0){
			result=length/p;
			resultAux=p;
			System.out.println(result);
			for(int i=0; i<result; i++){
				System.out.println(word.substring(aux,resultAux));
				aux=resultAux;
				resultAux=resultAux+p;
			}	
		}
		else if(length%q==0){	
			result=length/q;
			resultAux=q;
			System.out.println(result);
			for(int i=0; i<result; i++){
				System.out.println(word.substring(aux,resultAux));
				aux=resultAux;
				resultAux=resultAux+q;
			}	
		}
		else{
			if(q>p){
				worst=p;
				p=q;
				q=worst;
			}
			for(int i=length; i>=q; i-=p){
				length=length-p;
				if(length%q==0){
					countQ=length/q;
					break;
				}
				counterP++;
			}
			if(countQ>0){
				result=countQ+counterP;
				resultAux=p;

				System.out.println(result);
				
				for(int i=0; i<result; i++){
					System.out.println(word.substring(aux,resultAux));

					if((word.length()-resultAux)%q!=0){ 	
						aux=resultAux;	
						resultAux=resultAux+p;	
					}
					else {
						aux=resultAux;
						resultAux=resultAux+q;
					}
				}
			}
			else{
				System.out.println(-1);
			}
		}
	}
}