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
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

//package NumberTheory;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
/**
 *
 * @author Sourav Kumar Paul
 */
public class SolveA {
    public static void main(String[] args) throws IOException{
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
       StringTokenizer st = new StringTokenizer(reader.readLine());
       int n = Integer.parseInt(st.nextToken());
       int a = Integer.parseInt(st.nextToken());
       int b = Integer.parseInt(st.nextToken());
       int nn = n;
       String line = reader.readLine();
       char str[] = line.toCharArray();
       int count = 0;
       while(n % b != 0 )
       {
           n = n-a;
           if(n<0)
               break;
           count ++;
       }
       int ctr = 0;
       if(n%b==0)
       {
           ctr = n/b;
           n=0;
       }
       //System.out.println(count+ " "+ctr);
       if(n != 0)
           System.out.println("-1");
       else if(count + ctr>0)
       {   
           System.out.println(count + ctr);
           int j=0;
            
           for( int i=0; i<(ctr); i++)
           {
               for( int k=0; k<b; k++)
                   
               {
                   if(j<nn)
                   System.out.print(str[j]);
                   j++;
               }
               System.out.println();
                       
           }
          
           for(int i=0; i<count ; i++)
           {
               for( int k=0; k<a; k++)
                   if(j<nn)
               System.out.print(str[j++]);
               System.out.println();
              
           }
       }
       else
           System.out.println("-1");
       
    }
}
