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.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Main {

	static Scanner sc = new Scanner(System.in);
	
	static int n, p, q;
	static String str;
	
	public static void main(String[] args) throws FileNotFoundException{		
		n = sc.nextInt();
		p = sc.nextInt();
		q = sc.nextInt();
		str = sc.next();
		
		int a = 0, b = 0;
		for (a = 0;; a++) {
			if (n < p*a) {a = -1; break;}
			boolean find = false;
			for (b = 0;; b++) {
				if (n < p*a + q*b) break;
				
				if (n == p*a + q*b) {find = true; break;}
			}
			if (find) break;
		}
		
		if (a == -1) {System.out.println(-1); return;}
		
		System.out.println((a + b));
		int pos = 0;
		for (int i = 0; i < a; i++) {
			System.out.println(str.substring(pos, pos + p));
			pos += p;
		}
		
		for (int i = 0; i < b; i++) {
			System.out.println(str.substring(pos, pos + q));
			pos += q;
		}
	}
}