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.*;
import java.text.*;

public class Main {
		
	
	public static void main(String[] Args) {
		Scanner in = new Scanner(System.in);
		//HashMap<Integer,Integer> hm = new HashMap<Integer,Integer>();
		int n = in.nextInt();
		//int[] c = new int[1000000]; 10^6
		
	int p = in.nextInt();
	int q= in.nextInt();
	
	in.nextLine();
	String s= in.next();
	int c=0;
	int f=0;
	if(p==1 || q==1) {
		f=1;
		System.out.println(n);
		for(int i=0;i<n;i++) {
			System.out.println(s.charAt(i));
		}
	}
	else {
		ArrayList<String> ans = new ArrayList<String>();
		for(int i=0;i<=n;i++) {
		for(int j=0;j<=n;j++) {
			if(p*i+q*j==n) {
				f=1;
				for(int k=0;k<i;k++) {
					if(c+p>n  ) {
						break;
					}
					String ss = s.substring(c,c+p);
				//	System.out.println(ss);
					ans.add(ss);
					
					c+=p;
					
					
				}
				for(int k=0;k<j;k++) {
					if(c+q>n) {
						break;
					}
					String sk = s.substring(c,c+q);
					//System.out.println(sk);
					ans.add(sk);
					
					c+=q;
					
					
				}
			}
		}
	}
	if(f==0) {
		System.out.println("-1");
	}
	else
	{
		System.out.println(ans.size());
		for(int i=0;i<ans.size();i++) {
			System.out.println(ans.get(i));
		}
	}
	}
			in.close();
	}
}
