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 TheTextSplitting {
	
	public static int n;
	
	public static void main (String [] args) {
		Scanner scanner = new Scanner(System.in);
		
		n = scanner.nextInt(); 
		int p = scanner.nextInt(); 
		int q = scanner.nextInt(); 
		String s = scanner.next();
		int divisor; 
		
		if( n== p+q) {
			both(p, q, s);
		}else if(n%p==0) {
			divisor=p;
			one(divisor, s);
		}else if(n%q==0) {
			divisor=q;
			one(divisor, s);
		}else {
			int mayor;
			int menor;
			int counter=0;
			boolean can=false;
			int sum=0;
			
			if(p<q) {
				mayor = q; 
				menor = p;
			}else {
				mayor = p;
				menor = q;
			}
			for(int i=n; i>=menor; i-=mayor) {
				counter++;
				if( (i-mayor)%menor==0  ) {
					sum =(i-mayor)/menor;
					can=true;
					break;
				}				
			}
			
			if(can==true && sum>0) {
				rare(counter, mayor, menor, sum, s);
			}else {
				System.out.println("-1");
			}
			
		}
		
		scanner.close();		
	}
	
	public static void rare(int counter, int mayor, int menor, int sum, String s) {
			
		System.out.println(counter+sum);
		int a=0; 
		int b=mayor; 
		
		for(int i=0; i<counter; i++) {
			System.out.println(s.substring(a, b));
			a=b; 
			b=b+mayor;
		}

		a=mayor*counter;
		b=a+menor;

		for(int i=0; i<sum; i++) {
			System.out.println(s.substring(a, b));
			
			a=b; 
			b=b+menor;

		}
	}
	
	public static void both(int p, int q, String s) {
		System.out.println("2"); 
		System.out.println(s.substring(0, p));
		System.out.println(s.substring(p));
 
	}
	
	public static void one(int divisor, String s) {
		int q = n/divisor;
		int a=0; 
		int b=divisor;
		System.out.println(q);
		for(int i=0; i<q; i++) {
			System.out.println(s.substring(a, b));
			a=b; 
			b=b+divisor;
		}
	}
	
	
}