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.*;
import java.io.*;
public class Main {
    public static void main(String args[]){
        //Scanner s= new Scanner(System.in);
         InputReader s= new InputReader(System.in);
         OutputStream outputStream= System.out;
         PrintWriter out= new PrintWriter(outputStream);
         
         int n=s.nextInt();
         int a=s.nextInt();
         int b=s.nextInt();
         String ss=s.nextLine();
         int ans1=-1,ans2=-1;
         for(int i=0;;i++){
             for(int j=0;;j++){
                 if(a*i+b*j==n){
                    ans1=i;
                    ans2=j;
                 }
                 else if(a*i+b*j>n){
                     break;
                 }
             }
             if(a*(i+1)>n){
                 break;
             }
         }
         if(ans1!=-1 && ans2!=-1){
             out.println(ans1+ans2);
             for(int i=0;i<a*ans1;i+=a){
                 out.println(ss.substring(i,i+a));
             }
             for(int i=a*ans1;i<n;i+=b){
                 out.println(ss.substring(i,i+b));
             }
         }
         else
         {
             out.println(-1);
         }
                out.close();
         
    }
    
    static class InputReader {
        
        public BufferedReader reader;
        public StringTokenizer tokenizer;
 
        public InputReader( InputStream inputstream) {
          reader = new BufferedReader(new InputStreamReader(inputstream));
          tokenizer = null;
        }
        
        public String nextLine(){
            String fullLine=null;
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                  fullLine=reader.readLine();
                } catch (IOException e) {
                  throw new RuntimeException(e);
                }
                return fullLine;
              }
              return fullLine;
        }
        public String next() {
          while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
              tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
              throw new RuntimeException(e);
            }
          }
          return tokenizer.nextToken();
        }
        public long nextLong() {
              return Long.parseLong(next());
            }
        public int nextInt() {
          return Integer.parseInt(next());
        }
      }
}
