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

public class TextSplit 
{
	static String s;

	public static void main(String[] args)
	
	{
		MySim sc=new MySim();
		int n=sc.nextInt();
		int p=sc.nextInt();
		int q=sc.nextInt();
		
		s=sc.nextLine();
		if((n%p)==0)
		{
			System.out.println(n/p);
			find(p,n/p);
		}
		else if((n%q)==0)
		{
			System.out.println(n/q);
			find(q,n/q);
		}
		else
		{
			int flag=0;
			int f=0;
			for(int i=1;i<=99;i++)
			{
				for(int j=1;j<=99;j++)
				{
					
					if((i*p+j*q)==n)
					{
						
						System.out.println(i+j);
						flag=1;
						find(p,i);
						find(q,j);
					
						return;
						
					}
					
				}
			}
			if(flag==0)
			{
				System.out.println(-1);
			}
		}

	}
	public static void find(int v,int l)
	{
		for(int i=1;i<=l;i++)
		{
			String t=s.substring(0, v);
			System.out.println(t);
			s=s.substring(v);
		}
	}

}

class MySim
{
	BufferedReader br;
	StringTokenizer st;
	MySim()
	{
		br=new BufferedReader(new InputStreamReader(System.in));
	}
	String next()
	{
		
		while(st==null || !st.hasMoreTokens())
		{
			try
			{
				st=new StringTokenizer(br.readLine());
			}
			catch(Exception e)
			{
				e.printStackTrace();
			}
		}
		return st.nextToken();
		
	}
	int nextInt()
	{
		return Integer.parseInt(next());
	}
	long nextLong()
	{
		return Long.parseLong(next());
	}
	double nextDouble()
	{
		return Double.parseDouble(next());
	}
	String nextLine()
	{
		String str="";
		try
		{
			str=br.readLine();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
		return str;
		
	}
}