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
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
import java.util.Scanner;

/**
 *
 * @author diegomorenoacevedo
 */
public class TextSplit{
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner lector = new Scanner(System.in);
		int n = lector.nextInt();
		int p = lector.nextInt();
		int q = lector.nextInt();
		String s = lector.next();
		int i=0;
		while(p*i<=n){
			int j = n-p*i;
			if(j%q==0){
				int iteraciones= j/q;
				System.out.println(i+iteraciones);
				int iteraciones2=0;
				for(int num1=0; num1<i;num1++){
					System.out.println(s.substring(iteraciones2,p+iteraciones2));
					iteraciones2+=p;
				}
				for(int num1=0; num1<iteraciones;num1++){
					System.out.println(s.substring(iteraciones2,iteraciones2+q));
				  iteraciones2+=q;
				}
				return;
			}
			i++;
		}
		System.out.println("-1");
	}

}