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.IOException;
import java.io.InputStreamReader;

public class TheTextSplitting_CodeForces {

	
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String temp [] = br.readLine().split(" "); 
		int n = Integer.parseInt(temp[0]);
		int p = Integer.parseInt(temp[1]);
		int q = Integer.parseInt(temp[2]);
		String s =br.readLine();
	//	System.out.println(50/3);
		//System.out.println(40/14);
		if(p+q==n){
			System.out.println(2);
			System.out.println(s.substring(0,p));
			System.out.println(s.substring(p));
			System.exit(0);
		}
		if(n%p==0){
			int parts = n/p;
			int start=0;
			System.out.println(parts);
			for(int i=0;i<parts;i++){
				System.out.println(s.substring(start,start+p));
				start+=p;
			}
			System.exit(0);
		}
		
		if(n%q==0){
			int parts = n/q;
			int start=0;
			System.out.println(parts);
			for(int i=0;i<parts;i++){
				System.out.println(s.substring(start,start+q));
				start+=q;
			}
			System.exit(0);
		}
		int max =Math.max(p,q);
		int min = Math.min(p, q);
		int te=n;
		int maxNum=0;
		int minNum=0;
		while(te>=0){
			te-=max;
			maxNum++;
			if(te%min==0){
				minNum=te/min;
				break;
			}
		}
		if(minNum>0){
			//System.out.println("hereee "+ minNum);
			System.out.println(minNum+maxNum);
			int begin=0;
			for(int i=0;i<maxNum;i++){
				System.out.println(s.substring(begin, begin+max));
				begin+=max;
			}
			for(int i=0;i<minNum;i++){
				System.out.println(s.substring(begin, begin+min));
				begin+=min;
			}
			
			System.exit(0);
		}
		
		int rem = n%max;
		int maxTimes=0;
		int minTimes=0;
		if(rem%min==0){
			maxTimes=n/max;
			minTimes = rem/min;
		
		System.out.println(maxTimes+minTimes);
		int begin=0;
		for(int i=0;i<maxTimes;i++){
			System.out.println(s.substring(begin,begin+max));
			begin+=max;
		}
		//begin=0;
		for(int i=0;i<minTimes;i++){
			System.out.println(s.substring(begin,begin+min));
			begin+=min;
		}
		System.exit(0);
		}
		else 
		{
			System.out.println(-1);
			System.exit(0);
		}
			
//		if(n%p!=0 && n%q!=0){
//			System.out.println(-1);
//			System.exit(0);
//		}
		
		

	}
}
