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 Red {
    static FastScanner f;
    static PrintWriter pw = new PrintWriter(System.out);
    static long mod = 1000_000_007;
    static long oo = (long)3e18;
    static int ooo = (int)1e9;

    public static void solve()throws IOException {
        int n = f.ni(); int p = f.ni(); int q = f.ni();

        char s[] = f.next().toCharArray();

        int i = 0 , j = 0;
        boolean ok = false;
        
        for (; i <= n; ++i) {
            for (j = 0; j <= n; ++j) {
                int exp = (i * p) + (q * j);
                if (exp == n) {
                    ok = true;
                    break;
                }
            }
            if (ok) break;
        }

        if (!ok) {
            pn(-1);
            return;
        }

        pn((i + j));

        int ptr = 0;
        for (int itr = 0; itr < i; ++itr) {
            int cnt = 0;
            for (; cnt < p; ++ptr , ++cnt) {
                p(s[ptr]);
            }
            pn("");
        }

        for (int itr = 0; itr < j; ++itr) {
            int cnt = 0;
            for (; cnt < q; ++ptr , ++cnt) {
                p(s[ptr]);
            }
            pn("");
        }
    }   

    public static void main(String args[])throws IOException {
        go();
        boolean test_cases = false;
        int t = test_cases ? f.ni() : 1;
        while (t --> 0) solve();
        pw.flush();
        pw.close(); 
    }

    public static void go()throws IOException {
        if (System.getProperty("ONLINE_JUDGE") == null) {
            f = new FastScanner("");
        }
        else f = new FastScanner(System.in);
    }

    public static class FastScanner {
        StringTokenizer st;
        BufferedReader br;
 
        public FastScanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public FastScanner(String str) {
            try {
                br = new BufferedReader(new FileReader("inp.txt"));
            }
            catch (Exception e) {
                e.printStackTrace();
            }
        }
 
        public String next()throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }
 
        public int ni() throws IOException {return Integer.parseInt(next());}
 
        public long nl() throws IOException {return Long.parseLong(next());}
 
        public String nextLine() throws IOException {return br.readLine();}

        public double nd() throws IOException {return Double.parseDouble(next());}
    }

    public static long mul(long a , long b) {
        return ((a % mod) * (b % mod)) % mod;
    }

    public static void sort(int a[]) {
        ArrayList<Integer> x = new ArrayList<>();
        for (int i : a) x.add(i);
        Collections.sort(x);
        for (int i = 0; i < a.length; ++i) a[i] = x.get(i);
    }
    
    public static void sort(long a[]) {
        ArrayList<Long> x = new ArrayList<>();
        for (Long i : a) x.add(i);
        Collections.sort(x);
        for (int i = 0; i < a.length; ++i) a[i] = x.get(i);
    }

    public static void sort(ArrayList<Integer> arr) {Collections.sort(arr);}

    public static void pn(Object o){pw.println(o);}
        
    public static void p(Object o){pw.print(o);}
        
    public static void pni(Object o){pw.println(o);pw.flush();}

    static int gcd(int x , int y) {
        if (y == 0) return Math.abs(x);
        return gcd(y , x % y);
    }
}