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
// CodeForces Round #608 D done, after reading answer

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class RazbText {

	int n,p,q;
	String s;
	int npa;
	String []parts;
	
	private void readData(BufferedReader bin) throws IOException {
		String sss = bin.readLine();
		String []ss = sss.split(" ");
		n = Integer.parseInt(ss[0]);
		p = Integer.parseInt(ss[1]);
		q = Integer.parseInt(ss[2]);
		
		// allocations
		s = bin.readLine();
	}
	
	void printRes() {
		System.out.println(npa);
		if (npa>0) {
			for (int i = 0; i < parts.length; i++) {
				System.out.println(parts[i]);
			}
		}
	}
	
	
	/** mostly count d */
	private void calculate() {
		npa = -1;
		int np=0,nq=0;
		for (int i=0; i<100; i++) {
			int no = s.length() - i*p;
			if (no<0) {
				break;
			} else if (no%q==0) {
				np = i;
				nq = no/q;
				npa = np+nq;
			}
		}
		if (npa>0) {
			parts = new String[npa];
			int pp = 0;
			for (int i=0; i<np; i++) {
				parts[i] = s.substring(pp, pp+p);
				pp += p;
			}
			for (int i=0; i<nq; i++) {
				parts[np+i] = s.substring(pp, pp+q);
				pp += q;
			}
		}
	}

	public static void main(String[] args) throws IOException {
		// BufferedReader bin = new BufferedReader(new FileReader("cactus.in"));
		BufferedReader bin = new BufferedReader(new InputStreamReader(System.in));
		RazbText l = new RazbText();
		l.readData(bin);
		l.calculate(); 
		l.printRes();
	}
}
