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.*;
import java.util.*;
public class c278 {
	static InputReader in;

	public static void main(String args[]) throws Exception {
		in = new InputReader("input23.txt");
		int n = in.nextInt();
		int a = in.nextInt();
		int b = in.nextInt();
		String str = in.next();
		int a1 = 0, b1 = 0;
		if (n % a == 0) {
			System.out.println(n / a);
			for (int i = 0; i < n / a; i++) {
				System.out.println(str.substring(i * a, (i + 1) * a));
			}
		}
		else if (n % b == 0) {
			System.out.println(n / b);
			for (int i = 0; i < n / b; i++) {
				System.out.println(str.substring(i * b, (i + 1) * b));
			}
		}
		else {
			int p = n / a;
			int q = n / b;
			for (int i = 1; i <= p; i++) {
				for (int j = 1; j <= q; j++) {
					if (i * a + j * b == n) {
						a1 = i;
						b1 = j;
						break;
					}
				}
			}
			if (a1 == 0 && b1 == 0) System.out.println(-1);
			else {
				System.out.println(a1 + b1);
				int count = 0;
				for (int i = 0; i < a1; i++) {
					System.out.println(str.substring(count, count + a));
					count += a;
				}
				for (int i = 0; i < b1; i++) {
					System.out.println(str.substring(count, count + b));
					count += b;
				}
			}
		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tokenizer;

		public InputReader(String s) {
			try {
				in = new BufferedReader(new FileReader(new File(s)));
				tokenizer = null;
			}
			catch (Exception e) {
				in = new BufferedReader(new InputStreamReader(System.in));
				tokenizer = null;
			}
		}

		public String nextLine() throws Exception {
			return in.readLine();
		}

		public String next() throws Exception {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				tokenizer = new StringTokenizer(in.readLine());
			}
			return tokenizer.nextToken();
		}

		public int nextInt() throws Exception {
			return Integer.parseInt(next());
		}

		public double nextDouble() throws Exception {
			return Double.parseDouble(next());
		}

		public long nextLong() throws Exception {
			return Long.parseLong(next());
		}
	}
}