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 Mongo {

public static void main (String f[]) throws IOException
    {
        
        Reader.init(System.in);
        
        int n = Reader.nextInt();
        int p = Reader.nextInt();
        int q = Reader.nextInt();
        String s = Reader.next();
        int x= s.length();
    
        {
            StringBuilder bu = new StringBuilder();
            if(x%p==0)
            {
                int z=0;
                for (int i = 0; i <x; i++) {
                   bu.append(s.charAt(i));
                            z++;
                           if(z==p){
                                bu.append("\n");
                                z=0;
                          }
                }
                System.out.println(x/p+"\n"+bu.toString().trim());
            }
            else
                if(x%q==0)
                {
                    int z=0;
               for (int i = 0; i <x; i++) {
                   bu.append(s.charAt(i));
                            z++;
                           if(z==q){
                                bu.append("\n");
                                z=0;
                          }
                }
                System.out.println(x/q+"\n"+bu.toString().trim());
                }
            else
                {
                    int max =Math.max(p, q);
                    int min =Math.min(p, q);
                    int ss=0;
                    while((x-ss)%min!=0&&ss<x)
                    {
                        ss+=max;
                    }
                    if(ss>x)ss=0;
                    if((x-ss)%min==0)
                    {
                        int z=0;
                        for (int i = 0; i < ss; i++) {
                            bu.append(s.charAt(i));
                            z++;
                           if(z==max){
                                bu.append("\n");
                                z=0;
                          }
                        }
                        z=0;
                        for (int i = ss; i < x; i++) {
                            bu.append(s.charAt(i));
                            z++;
                          if(z==min){
                                bu.append("\n");
                                z=0;
                          }
                        }
                        System.out.println(ss/max+(x-ss)/min);
                        System.out.println(bu.toString().trim());
                    }
                    else
                    {
                    ss=0;
                    while((x-ss)%max!=0&&ss<=x)
                    {
                        ss+=min;
                    }
                    if(ss>x)ss=0;
                    if((x-ss)%max==0)
                    {
                       int z=0;
                        for (int i = 0; i <ss; i++) {
                          bu.append(s.charAt(i));
                            z++;
                           if(z==min){
                                bu.append("\n");
                                z=0;
                          }
                        }
                         z=0;
                        for (int i = ss; i < x; i++) {
                          
                            bu.append(s.charAt(i));
                            z++;
                           if(z==max){
                                bu.append("\n");
                                z=0;
                          }
                        }
                        System.out.println(ss/min+(x-ss)/max);
                        System.out.println(bu.toString().trim());
                     
                    }
                    else
                    {
                        System.out.println("-1");
                        return;
                    }
                    
                    }   
                    
                    
                    
                }
        }
        
        
        
            
    
    }


}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }           

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}
