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.io.*;
import java.math.*;
public class Draven {

	public static void main(String args[])
	{
		Scanner in = new Scanner(System.in);
		int n,p,q;
		String x;
		while ( in.hasNextInt() )
		{
			n = in.nextInt();
			p = in .nextInt();
			q = in.nextInt();
			in.nextLine();
			x = in.nextLine();
			boolean yes = false;
			int howp = 0, howq = n;
			for ( int i = 0 ; i <= n; i++ )
			{
				for ( int ii = 0 ; ii <= n ; ii++ )
				{
					if ( i*p+ii*q == n )
					{
						yes = true;
						howp = i;
						howq = ii;
						break;
					}
				}
				if ( yes ) break;
			}
			if ( !yes )
			{
				System.out.println(-1);
				continue;
			}
			System.out.println(howp+howq);
			int begin = 0 , end = p;
			for ( int i = 0 ; i < howp ; i++ )
			{
				System.out.println(new String(x.substring(begin, end)));
				begin += p;
				end += p;
			}
			end -= p;
			end += q;
			for ( int i = 0 ; i < howq ; i++ )
			{
				System.out.println(new String(x.substring(begin, end)));
				begin += q;
				end += q;
			}
			
		}
			
		
	}
	
}
