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 Masked{
	
	public static void main(String args[]){
		int t,p,q;
		String s;
		Scanner  scan = new Scanner(System.in);
		t = scan.nextInt();
		p = scan.nextInt();
		q = scan.nextInt();
		scan.nextLine();
		s = scan.nextLine();
		int pMax = t/p;
		int qMax = t/q;
		
		int m = 0;
		int n = 0;
		
		for(int i = 0  ; i <= pMax ; i++){
			int first = p*i;
			int second = t - first;
			//System.out.println("first: "+first);
			//System.out.println("second: "+second);
			if(first == t){
				m = first;
				n = 0;
				break;
			}else if(second % q == 0){
				m = first;
				n = second;
				break;
			}else if(i ==  pMax){
				m = -1;
				break;
			}
		}
		if(m == -1){
			System.out.println(-1);
			return;
		}
		int d = m/p;
		int d1 = n/q;
	//	System.out.println("d: "+d+" d1: "+d1);
		int nk = 0;
		System.out.println(d+d1);
		for(int i = 1 ; i <=d ; i++){
			int first = (i-1)*p;
			int second = i*p;
			nk = second;
			System.out.println(s.substring(first,second));
		}
		
		for(int i = 1 ; i <= d1 ; i++){
			int first = nk+(i-1)*q;
			int second = nk+i*q;
			System.out.println(s.substring(first,second));
		}
		
		
		
	}
	
	
}