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 Text_Splitting {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int length = in.nextInt();
		int len1 = in.nextInt();
		int len2 = in.nextInt();
		String s = in.next();
		boolean stop = false;
		int count = 0;
		int a = 0;
		int b = 0;
		
		for(a = 0; a<=length; a++) {
			for(b = 0; b <=length; b++) {
				if(a*len1 + b*len2 == length) {
					stop = true;
					break;
				}
			}
			if(stop){
				break;
			}
		}
		
		count = a + b;
		
		if(count < 2*length){
	        System.out.println(count);
	        for (int i = 0; i < a; i++)
	            System.out.println(s.substring(i*len1, (i + 1)*(len1)));
	        for (int i = 0; i < b; i++)
	            System.out.println(s.substring(a*len1 + i*len2 ,a*len1 + (i + 1)*(len2)));
	    }
		else {
			System.out.println("-1");
		}
		
}
}
