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 TextSp{
	public static void main(String[] args) {
		Scanner tm=new Scanner(System.in);
		int length=tm.nextInt();
		int p=tm.nextInt();
		int q=tm.nextInt();
		int ans=0;
		int ans1=0;
		int ayu=0;
		int peor=0;
		int cp=1;
		int cq=0;
		String s=tm.next();
		if(length%(p+q)==0 && p!=q){
		int r=length/(p+q);
		ans=length/(p+q)*2;
		ans1=p;
		System.out.println(ans);

		for(int i=0; i<r; i++){
		System.out.println(s.substring(ayu,ans1));
		ayu=ans1;
		ans1=ans1+q;
		System.out.println(s.substring(ayu,ans1));
		ayu=ans1;
		ans1=ans1+p;
		}
	}
	else if(length%p==0){
		ans=length/p;
		ans1=p;
		System.out.println(ans);
		for(int i=0; i<ans; i++){
		System.out.println(s.substring(ayu,ans1));
		ayu=ans1;
		ans1=ans1+p;
			}	
		}
	else if(length%q==0){	
		ans=length/q;
		ans1=q;
		System.out.println(ans);
		for(int i=0; i<ans; i++){
		System.out.println(s.substring(ayu,ans1));
		ayu=ans1;
		ans1=ans1+q;
			}	
		}
	else{
		if(q>p){
		peor=p;
		p=q;
		q=peor;
		}
	for(int i=length; i>=q; i-=p){
		length=length-p;
		if(length%q==0){
		cq=length/q;
		break;
		}
		cp++;
	}
	if(cq>0){
		ans=cq+cp;
		ans1=p;

		System.out.println(ans);
				
		for(int i=0; i<ans; i++){
		System.out.println(s.substring(ayu,ans1));

		if((s.length()-ans1)%q!=0){ 	
		ayu=ans1;	
		ans1=ans1+p;	
		}
		else {
		ayu=ans1;
		ans1=ans1+q;
		}
	}
}
	else{
	System.out.println(-1);
			}
		}
	}
}