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.*;

public class Practice
{
    public static void main(String[] args) throws IOException
    {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String[] s = reader.readLine().split(" ");
        int n = Integer.parseInt(s[0]);
        int p = Integer.parseInt(s[1]);
        int q = Integer.parseInt(s[2]);
        String t = reader.readLine();
        boolean yes = true;
        int temp;
        int a = 0;
        int b = 0;
        int f = (int)Math.ceil(n / ((int)Math.min(p, q)));
        f++;
        
        for(int i = 0; i < f && yes; i++)
        {
            for(int j = 0; j < f && yes; j++)
            {
                temp = p * i + q * j;
                if((temp != 0) && (n == temp))
                {
                    yes = false;
                    a = i;
                    b = j;
                }
            }
        }
        
        if(!yes) System.out.println(a + b);
        if(yes) System.out.println("-1");
        else
        {
            for(int i = 0; i < a * p; i += p) System.out.println(t.substring(i, i + p));
            for(int i = p * a; i < n; i += q) System.out.println(t.subSequence(i, i + q));
        }
        
        
    }
}