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 Split{
	public static void main(String[] args){
		
		//40 caracteres: qwertyuiopasdfghjklzxcvbnmqwertyuiopasdf;
		Scanner sc = new Scanner(System.in); 
		int n = sc.nextInt();
		int p = sc.nextInt();
		int q = sc.nextInt();
		sc.nextLine();
		String s = sc.nextLine();
		char[] m = new char[n];
		m = s.toCharArray();
		
		int contador = 0;
		
		if(n%p==0){
			System.out.println(n/p);
			for(int i=0;i<n/p;i++){
				for(int j=0; j<p;j++){
					System.out.print(m[j+p*i]);
				}
				System.out.println();
			}
		}
		
		else if(n%q==0){
			System.out.println(n/q);
			for(int i=0;i<n/q;i++){
				for(int j=0; j<q;j++){
					System.out.print(m[j+q*i]);
				}
				System.out.println();
			}
			
		}else if(p>q){
			int mul = 0;
			int part = 0;
			while(n>p){
				if(n%q==0){break;}
				n = n-p;
				mul++;
			}
			if(n%q==0){

				System.out.println(mul+n/q);
				for(int i=0; i<mul; i++){
					for(int j=0; j<p; j++){
						System.out.print(m[j+p*i]);
					}
					System.out.println();
				}
				for(int i=0; i<n/q; i++){
					for(int j=0; j<q; j++){
						System.out.print(m[j+mul*p+q*i]);
					}
					System.out.println();
				}
			}
			else{System.out.println(-1);}
		}else if(q>p){
			int mul = 0;
			int part = 0;
			while(n>q){
				if(n%p==0){break;}
				n = n-q;
				mul++;
			}
			if(n%p==0){
				System.out.println(mul+n/p);
				for(int i=0; i<mul; i++){
					for(int j=0; j<q; j++){
						System.out.print(m[j+q*i]);
					}
					System.out.println();
				}
				for(int i=0; i<n/p; i++){
					for(int j=0; j<p; j++){
						System.out.print(m[j+mul*q+p*i]);
					}
					System.out.println();
				}
			}
			else{System.out.println(-1);}
		}else{
			System.out.println(-1);
		}
		
	}
}