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 test {
	public static void main(String[] args){
	Scanner s=new Scanner(System.in);
     int a=s.nextInt();
     int x=a;
     int u=a;
     int y=0;
     int b=s.nextInt(); int q=b; 
     int r=0;
     int e=0;int w=0;
     int ar[]=new int[100];
     int arr[]=new int[100];
     int c=s.nextInt(); int l=c; 
     int o=0;
     int p=0;
     s.nextLine();
     String z=s.nextLine();
     
     
     while(x>0){
    	 if(x==0) break;
    	 if(x%b==0){
    		 y=1; break;
    	 }
    	 if(x%c==0){
    		 r=1; break;
    	 }
    
    		 x=x-c;
    		 ar[e]=c;
    		 e++;
    	 
    	 
     }
     if(y==0&&r==0){
    	 while(u>0){
        	 if(u==0) break;
        	 if(u%b==0){
        		 y=1; break;
        	 }
        	 if(u%c==0){
        		 r=1; break;
        	 }
        	
    		 u=u-b;
    		 arr[w]=b;
    		 w++;
    	  
     }
     }	     
     if(y==0&&r==0) System.out.println("-1");
     if(y==1&&arr[0]==0&&ar[0]==0){
    	 System.out.println(a/b);
    	 int m=b;
    	 for(int i=0;i<a/b;i++){
    		 System.out.println(z.substring(o,m));
    		 o=m;
    		 m=q+m;
    	 }
     }
     if(r==1&&arr[0]==0&&ar[0]==0){
    	 System.out.println(a/c);
    	 int v=c;
    	 for(int i=0;i<a/c;i++){
    		 System.out.println(z.substring(o,v));
    		 o=v;
    		 v=l+v;
    	 }
     }
     if(y==1&&ar[0]!=0){
    	 int d=a;
    	 int g=0;
    	 while(ar[g]!=0){
    		 g++;
    		 d=d-c;
    	 }
    	 System.out.println((d/b)+g);
    	 int i=0;
    	 int v=ar[0];
    	 while(ar[i]!=0){
    		 
    		 System.out.println(z.substring(o,v));
    		 o=v;
    		 i++;
    		if(ar[i]!=0) v=l+v;
    		 a=a-c;
    		 }
    	 
    	 int m=v;
    	 int n=b;
    	 while(a>0){
    		 System.out.println(z.substring(m,v+b));
    		 m=v+b;
    		 a=a-n;
    		 b=b+q;
    		
    	 }
    	 
     }
     if(r==1&&arr[0]!=0){
    	 int i=0;
    	 int v=arr[0];
    	 int d=a;
    	 int g=0;
    	 while(arr[g]!=0){
    		 g++;
    		 d=d-b;
    	 }
    	 System.out.println((d/c)+g);
    	 while(arr[i]!=0){
    		 
    		 System.out.println(z.substring(o,v));
    		 o=arr[i];
    		 i++;
    		if(arr[i]!=0) v=q+v;
    		 a=a-b;
    		 }
    	 int m=v;
    	 int n=c;
    	 while(a>0){
    		 System.out.println(z.substring(m,v+c));
    		 m=v+c;
    		 a=a-n;
    		 c=c+q;
    		
    	 }
     }
    
     }}