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
//package Mssolved;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;

public class textSplitting {
	static int pos[], memo[];
	static int INF = (int) 1e9;
	static boolean memo2[];
	static void print(int size) {
		if (size <= 0)
			return;
		boolean opt = dp(size);
		boolean tmp = dp(size - pos[0]);
		if (tmp) {
			res.add(pos[0]);
			print(size - pos[0]);
		} else {
			res.add(pos[1]);
			print(size - pos[1]);
		}
	}

	static ArrayList<Integer> res;

	public static boolean dp(int size) {
		if (size < 0)
			return false;
		else if (size == 0)
			return true;
		if (memo[size] != -1)
			return memo2[size];
		boolean take = dp(size - pos[0]);
		boolean leave = dp(size - pos[1]);
		memo[size]=1;
		return memo2[size] = take||leave;
	}

	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(in.readLine());
		int n = Integer.parseInt(st.nextToken());
		int p = Integer.parseInt(st.nextToken());
		int q = Integer.parseInt(st.nextToken());
		char []word = in.readLine().toCharArray();
		memo = new int[n + 1];
		// memo2=new int[n+1][2];
		pos = new int[] { p, q };
		Arrays.fill(memo, -1);
		// for (int i = 0; i < memo.length; i++) {
		//// Arrays.fill(memo2[i], -1);
		// Arrays.fill(memo[i], -1);
		// }
		memo2=new boolean[n+1];
		boolean tr = dp(n);
		
		
		// int tr2=dp(n,1);
		if(!tr) {
			System.out.println(-1);
		} else {
			res = new ArrayList<Integer>();
			print(n);
			int c=0;
			System.out.println(res.size());
			for (int i = 0; i < res.size(); i++) {
//				System.out.println(c+" "+res.get(i));
				for (int j = c; j <c+res.get(i); j++) {
					System.out.print(word[j]);
				
				}
				c+=res.get(i);
				System.out.println();
			}
		}
	}
}
