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 A {
	public static void main(String[] argv){
		Scanner sc = new Scanner(System.in);
		int len,p,q,tmp;
		int full,left = 0,k = 0,id=0;
		String line;
		len=sc.nextInt();
		p=sc.nextInt();
		q=sc.nextInt();
		sc.nextLine();
		line=sc.nextLine();
		if(q>p){
			tmp=p;
			p=q;
			q=tmp;
		}
		if(len%p!=0){
			full=len/p;
			left=len-full*p;
			if(len%q==0){
				full=len/q;
				k=full;
				id=2;
			}
			else if(left%q==0){
				k=full+left/q;
				id=3;
			}
			else{
				while(full>0){
					full--;
					left=len-full*p;
					if(left%q==0){
						k=full+left/q;
						id=3;
						break;
					}
				}
				if(id==0)
					k=-1;
			}
		}
		else{
			full=len/p;
			k=full;
			id=1;
		}
		System.out.println(k);
		if(k>0){
			int end=0,start=0;
			switch (id) {
			case 1:
				for(int i=0;i<k;i++){
					end+=p;
					String l = line.substring(start, end);
					start=end;
					System.out.println(l);
				}
				break;
			case 2:
				for(int i=0;i<k;i++){
					end+=q;
					String l = line.substring(start, end);
					start=end;
					System.out.println(l);
				}
				break;
			case 3:
				String l;
				for(int i=0;i<full;i++){
					end+=p;
					l = line.substring(start, end);
					start=end;
					System.out.println(l);
				}
				for(int i=full;i<k;i++){
					end+=q;
					l = line.substring(start, end);
					start=end;
					System.out.println(l);
				}
				break;
			default:
				System.out.println("ERROR in identifier.");
				break;
			}
		}
		sc.close();
	}
}
