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.*;
import java.lang.*;
import java.io.*;


public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner in = new Scanner (System.in);
		int n, p, q;
		String s;

		n = in.nextInt();
		p = in.nextInt();
		q = in.nextInt();

		do {
			s = in.nextLine();
		} while (s.trim().isEmpty());

		int length = s.length();
		int aux = 0;
		if (length % p == 0){
			System.out.println(length / p);
			while (aux < length){
				System.out.println(s.substring(aux, aux + p));
				aux += p;
			}

		} else if (length % q == 0){
			System.out.println(length / q);
			while (aux < length){
				System.out.println(s.substring(aux, aux + q));
				aux += q;
			}

		} else {
			int a = 1;
			boolean achei = false;
			while ((a*p < length || a*q < length) && !achei){
				if (a*p < length && (length - a*p) % q == 0){
					System.out.println(a + ((length - a*p) / q));
					while (a > 0){
						System.out.println(s.substring(aux, aux + p));
						aux += p;
						a--;
					}

					while (aux < length){
						System.out.println(s.substring(aux, aux + q));
						aux += q;
					}
					achei = true;

				} else if (a*q < length && (length - a*q) % p == 0){
					System.out.println(a + ((length - a*q) / p));
					while (a > 0){
						System.out.println(s.substring(aux, aux + q));
						aux += q;
						a--;
					}

					while (aux < length){
						System.out.println(s.substring(aux, aux + p));
						aux += p;
					}

					achei = true;
				}

				a++;
			}


			if (!achei){
				System.out.println(-1);
			}
		}


	}
}
// 1461929755957