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 TextSplitting{

	public static void main(String[] args) {

		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int p = scanner.nextInt();
		int q = scanner.nextInt();
		String s = scanner.next();

		int count = 0;

		for(int i = 1; i<=n/p; i++){

			for(int j = 1; j<=n/q; j++){
				if((i*p + j*q) == n){
					System.out.println(i + j);

					for(int k = 1; k <= i; k++){
						System.out.println(s.substring(k*p-p,k*p));
						count = k*p;
					}
					for(int l = count; l <= n-q  ; l+=q){
						System.out.println(s.substring(l,l+q));
					}
				return;
				}
			}
		}
		if(n%p == 0){
			System.out.println(n/p);
			for(int k = 1; k <= n/p; k++){
				System.out.println(s.substring(k*p-p,k*p));
			}
		}
		else if(n%q == 0){
			System.out.println(n/q);
			for(int l = 1; l <= n/q; l++){
				System.out.println(s.substring(l*q-q,l*q));
			}
		}
		else if(count==0)
			System.out.println(-1);



	}




}
