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.*;

public class textS{
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);

		int n,p,q;
		int res;
		String cads[];
		n=scanner.nextInt();
		p=scanner.nextInt();
		q=scanner.nextInt();

		scanner.nextLine();

		String s;
		s=scanner.nextLine();

		if(n%p==0){
			res=n/p;
			cads = new String[res];
			System.out.println(res);
			for(int i=0;i<res;i++){
				cads[i]=s.substring(i*(p),p+(p*i));
				System.out.println(cads[i]);
			}
		}else if(n%q==0){
			res=n/q;
			cads = new String[res];
			System.out.println(res);
			for(int i=0;i<res;i++){
				cads[i]=s.substring(i*(q),q+(q*i));
				System.out.println(cads[i]);
			}
		}else{
			cads = new String[n];
			String aux = s;
			int ai=0;
			while(aux.length()%q!=0 && aux.length()>p){
				cads[ai]=aux.substring(0,p);
				//System.out.println(aux);
				aux=aux.substring(p,aux.length());
				//System.out.println(aux);
				ai++;
			}
			if(aux.length()%q==0){
				res = aux.length()/q;
				res+=ai;
				System.out.println(res);
				for(int i =ai;i<res;i++){
					cads[i]=aux.substring((i-ai)*(q),q+(q*(i-ai)));
				//	System.out.println(cads[i]);
				}
				for(int i=0;i<res;i++){
					System.out.println(cads[i]);
				}
			}else{
				System.out.println(-1);
			}
		}

	}
}