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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Map.Entry;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class Test 
{


	public static void main(String[]args)throws Throwable
	{
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		int n = sc.nextInt();
		int p = sc.nextInt(); int q = sc.nextInt();
		int numA = -1;
		int numB = -1;
		String s = sc.next();
		for(int i = 0 ; i < 200 ; ++i)
		{
			for(int j = 0 ; j < 200 ; ++j)
			{
				if(n == p * i + q * j)
				{
					numA = i;
					numB = j;
					break;
				}
			}
		}
		if(numA == -1 && numB == -1)
		{
			out.println("-1");
			out.flush();
			out.close();
			return;
		}
		out.println(numA + numB);
		int ptr = 0;
		while(ptr < n && numA > 0)
		{
			int j = p;
			while(ptr < n && j > 0)
			{
				out.printf("%c", s.charAt(ptr++));
				--j;
			}
			numA--;
			out.print("\n");
		}
	//	ptr = 0;
		while(ptr < n && numB > 0)
		{
			int j = q;
			while(ptr < n && j > 0)
			{
				out.printf("%c", s.charAt(ptr++));
				--j;
			}
			numB--;
			out.print("\n");
		}
		
		out.flush();
		out.close();

	}


	static class Scanner
	{
		BufferedReader br;
		StringTokenizer st;


		Scanner(InputStream s)  { br = new BufferedReader(new InputStreamReader(s)); }

		String next() throws IOException
		{

			while(st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();

		}
		int nextInt() throws NumberFormatException, IOException { return Integer.parseInt(next()); }



	}
}
