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 Splitting {
	static int n, p, q;
	static int pFactor = 0;
	static int qFactor = 0;
	
	public static void getFactors(int num) {
		if(num < 0)
			return;
		if(num % p == 0) {
			pFactor += num / p;
			return;
		}
		if(num % q == 0) {
			qFactor += num / q;
			return;
		}
		
		pFactor++;
		qFactor++;
		getFactors(num - p - q);
	}
	
	public static boolean validFactors() {
		return p * pFactor + q * qFactor == n;
	}
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		
		String nums = in.nextLine();
		Scanner nIn = new Scanner(nums);
		n = nIn.nextInt();
		p = nIn.nextInt();
		q = nIn.nextInt();
		
		
		in.useDelimiter("");
		char[] s = new char[n];
		for(int i = 0; i < n; i++) {
			char c = in.next().charAt(0);
			s[i] = c;
		}
		
		getFactors(n);
//		System.out.println("pFactor: " + pFactor);
//		System.out.println("qFactor: " + qFactor);
		
		if(!validFactors()) {
			System.out.println("-1");
			return;
		}
		
		System.out.println(pFactor + qFactor);
		int k = 0;
		for(int i = 0; i < pFactor; i++) {
			for(int j = 0; j < p; j++) {
				System.out.print(s[k++]);
			}
			System.out.println();
		}
		for(int i = 0; i < qFactor; i++) {
			for(int j = 0; j < q; j++) {
				System.out.print(s[k++]);
			}
			System.out.println();
		}
	}
}