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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;


 public class Test
 { 
     static PrintWriter pw = new PrintWriter(System.out);
     static int a,b;
     
     static boolean check(int n , int p , int q)
     {
         int x = n/p;
         for(int i = 1 ; i<=x ; i++){
             int z = n - (p * i);
             if(z % q == 0)
             {
                 a = i;
                 b = z/q;
                 return true;
             }
         }
         return false;
     }
    
    public static void main(String[] args)throws Exception
    {
        Reader.init(System.in);
        int n = Reader.nextInt();
        int p = Reader.nextInt();
        int q = Reader.nextInt();
        String s = Reader.next();
        int z = 0;
        int count = 0;
        String str = "";
        
        if(n % p == 0){
            
            int x = n/p;
            for(int j = 1 ; j<=x ; j++)
            {
                for(int i = 1 ; i<=p ; i++){
                    str += s.charAt(z);
                    z++;
                }
                str += "\n";
                count ++;;
            }
            pw.print(count + "\n" + str);
        }
        
          else if(n % q == 0){
            
            int x = n/q;
            for(int j = 1 ; j<=x ; j++)
            {
                for(int i = 1 ; i<=q ; i++){
                    str += s.charAt(z);
                    z++;
                }
                str += "\n";
                count ++;
            }
            
            pw.print(count + "\n" + str);
        }
        
        else if(check(n,p,q))
        { 
            for(int j = 1 ; j<=a ; j++)
            {
                for(int i = 1 ; i<=p ; i++){
                    str += s.charAt(z);
                    z++;
                }
                str += "\n";
                count ++;
            }

            for(int j = 1 ; j<=b ; j++){
                for(int i = 1 ; i<=q ; i++){
                    str += s.charAt(z);
                    z++;
                }
                str += "\n";
                count ++;
            }
            pw.print(count + "\n" + str);
        }
      
        else
            pw.println("-1");
             
        pw.close();
    }
     
    
}
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());
    }
}