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 P612A
{
	public static void main(String[] args)
	{
		Scanner scan = new Scanner(System.in);
		String line = scan.nextLine();
		int n = Integer.parseInt(line.split(" ")[0]);
		int p = Integer.parseInt(line.split(" ")[1]);
		int q = Integer.parseInt(line.split(" ")[2]);
		
		if (n == 0 || n < p && n < q)
		{
			System.out.println(-1);
			return;
		}
		String str = scan.nextLine();
		int min = 0;
		if (q < p) //Make p the smaller number
		{
			min = q;
			q = p;
			p = min;
		}
		int t = n/p; //times to loop
		int sum = 0;
		int numP = 0, numQ = 0;
		for (numP = t; numP >= 0; numP--)
		{
			sum = numP * p;
			if ((n-sum) % q == 0)
			{
				numQ = (n-sum) / q;
				break;
			}
		}
		System.out.println(numP + numQ);
		int index = 0;
		for (int i = 0; i < numP; i++)
		{
			System.out.println(str.substring(index, index+p));
			index += p;
		}
		for (int i = 0; i < numQ; i++)
		{
			System.out.println(str.substring(index, index+q));
			index += q;
		}
	}
}
