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 A {
	public static void main(String[] args) {
		try(Scanner scan = new Scanner(System.in)) {
			int N = scan.nextInt(), p =scan.nextInt(), q = scan.nextInt();
			String s=  scan.next();
			if(p+q==N){
				System.out.println(2);
				System.out.println(s.substring(0, p)+"\n"+s.substring(p, N));
				return;
			}
			if(N%p==0){
				System.out.println(N/p);
				for(int i=0;i<N/p;i++){
					System.out.println(s.substring(i*p, (i+1)*(p)));
				}
				return;
			}
			if(N%q==0){
				System.out.println(N/q);
				for(int i=0;i<N/q;i++){
					System.out.println(s.substring(i*q, (i+1)*(q)));
				}
				return;
			}
			int a=-1, b=-1;
			boolean found = false;
			for(int i=2;i<=N/p;i++){
				for(int j=1;j<=N/q;j++){
					if(i*p+j*q==N){
						a=i;b=j;found=true;break;
					}
				}if(found)break;
			}
			if(found){
				System.out.println(a+b);
				for(int i=0;i<a;i++)System.out.println(s.substring(i*p, (i+1)*p));
				for(int i=0;i<b;i++)System.out.println(s.substring(a*p+i*q, a*p+(i+1)*q));
				return;
			}
			for(int i=2;i<=N/q;i++){
				for(int j=1;j<=N/p;j++){
					if(i*q+j*p==N){
						a=i;b=j;found=true;break;
					}
				}if(found)break;
			}
			if(found){
				System.out.println(a+b);
				for(int i=0;i<b;i++)System.out.println(s.substring(i*p, (i+1)*p));
				for(int i=0;i<a;i++)System.out.println(s.substring(b*p+i*q, b*p+(i+1)*q));
			}else{System.out.println(-1);}
		}
	}
}
