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
//package codeforcesnew;

import java.util.Scanner;

//Prob 612A
public class TextSplitting {
	
	String s;
	int n;
	int p;
	int q;
	Scanner input;
	
	public TextSplitting(){
		
		input = new Scanner(System.in);
		n = input.nextInt();
		p = input.nextInt();
		q = input.nextInt();
		input.nextLine();
		s = input.next();
		input.close();
		if(p==0||q==0||n==0) System.out.println("-1");
		else perform();
	}
	
	public void perform(){
		
		if(n%p==0) DoIt(p,true);
		else if(n%q==0) DoIt(q,true);
		else DoIt(p+q,false);
		
	}
	
	public void DoIt(int factor,boolean flag) {
		StringBuilder sb = new StringBuilder(s);
		int count =0;
		int x=0;
		int y=0;
		if(flag==true){
			count = n/factor;
			System.out.println(count);
			for(int i=0;i<sb.length();i+=factor) System.out.println(sb.substring(i,i+factor));
			
		}
		else {
			int end = n/p;
			for(int i =0;i<=end;i++)
			{
				if((n-p*i)%q==0){
				  x = i;
				  y = (n-p*i)/q;
				}
			}
			if(x==0&&y==0) System.out.println("-1");
			else{
				System.out.println(x+y);
				
				for(int i=0;i<=x*p-p;i+=p)        System.out.println(sb.substring(i,i+p));
				
				for(int i=x*p;i<sb.length();i+=q) System.out.println(sb.substring(i,i+q));
			}
		}
		
	}
	
	public static void main(String args[]) {
		new TextSplitting();
	}

}
