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.InputStreamReader;
import java.util.Arrays;
import java.util.Stack;
import java.util.StringTokenizer;

public class A {

    public static void main(String[] args) throws Exception{
        // TODO Auto-generated method stub
        
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        
        StringTokenizer st = new StringTokenizer(br.readLine());
        
        int N = Integer.parseInt(st.nextToken());
        int p = Integer.parseInt(st.nextToken());
        int q = Integer.parseInt(st.nextToken());
        
        String s = br.readLine();
        
        findSolution(N, p, q, s);
    }
    public static void findSolution(int N, int p, int q, String s){
        
        boolean [] pathTo = new boolean[N+1];
        pathTo[0]=true;
        for(int i=0 ;i<=N ;i++){
            if(i - p >=0 && pathTo[i-p]){
                pathTo[i]=true;
            }
            if(i-q >=0 && pathTo[i-q]){
                pathTo[i]=true;
            }
        }
        
        //System.out.println(Arrays.toString(pathTo));
        
        if(pathTo[N] == false) {
            System.out.println("-1");
            return;
        }
        Stack<Integer> step = new Stack<Integer>();
        
        int index = N;
        while(index >0){    
            int stepBack = 0;
            
            if((index - q) >= 0 && pathTo[index-q]){
                stepBack = q;
            }
            else if((index - p) >= 0 && pathTo[index-p]){
                stepBack = p;
            }
            step.push(stepBack);
            index -=stepBack;
        }
        
        System.out.println(step.size());
        int current = 0;
        while((!step.isEmpty())){
            int howMuch = step.pop();
            System.out.println(s.substring(current, current+howMuch));
            current+=howMuch;
        }
        
    }
}
