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 TheTextSplitting {
	public static void main(String args[]){
		Scanner scan= new Scanner(System.in);
		int n=scan.nextInt();
		int p=scan.nextInt();
		int q=scan.nextInt();
		String str=scan.next();
		System.out.println(split(str,p,q));
	}
	public static String split(String str,int p,int q){
		String result;
		if(str.length()==p+q)
		{
			result=2+"\n";
			result+=str.substring(0,p)+"\n";
			result+=str.substring(p);
			return result;
		}
		if(str.length()%p==0){
			result=str.length()/p+"\n";
			while(str.length()>0){
				result+=str.substring(0,p)+"\n";
				str=str.substring(p);
			}
			return result;
		}
		if(str.length()%q==0){
			result=str.length()/q+"\n";
			while(str.length()>0){
				result+=str.substring(0,q)+"\n";
				str=str.substring(q);
			}
			return result;
		}
		if(isPos(str.length(),q,p)){
			result="";
			int count=0;
			while(str.length()%p!=0){
				result+=str.substring(0,q)+"\n";
				str=str.substring(q);
				count++;
			}
			while(str.length()!=0)
			{
				result+=str.substring(0,p)+"\n";
				str=str.substring(p);
				count++;
			}
			return count+"\n"+result;
		}
		if(isPos(str.length(),p,q)){
			result="";
			int count=0;
			while(str.length()%q!=0){
				result+=str.substring(0,p)+"\n";
				str=str.substring(p);
				count++;
			}
			while(str.length()!=0)
			{
				result+=str.substring(0,q)+"\n";
				str=str.substring(q);
				count++;
			}
			return count+"\n"+result;
		}
		return "-1";
	}
	public static boolean isPos(int n,int q,int p){
		while(n>=0&&n%p!=0)
			n-=q;
		if(n<0)
			return false;
		return true;
	}
}
