The Text Splitting

E - The Text Splitting

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

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.

Sample Input

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
代码一：
#include<cstdio>
char s[1000000];
int main()
{
	int n,p,q,k,l1,l2,l,g;
	while(scanf("%d %d %d",&n,&p,&q)!=EOF)
	{
		scanf("%s",&s);
		g=1;
		for(int i = 0; i <= n ; i++)
		{
		 	for( int j = 0; j <= n ; j++)
			{
				if(i*p+j*q == n)
				{
					printf("%d\n",i+j);
					k=-1;
					while(i--)
					{
						l=p;
						while(l--)
						{
							printf("%c",s[++k]);
						}
						printf("\n");
					}		
					while(j--)
					{
						l=q;
						while(l--)
						{
							printf("%c",s[++k]);
						}
						printf("\n");
					}
					g=0;
					break;
				}
			}
			if(g == 0) break;
		}
		if(g != 0) printf("-1\n");	
	}
	return 0; 
}
代码二：
#include<cstdio>
#include<cstring>
char str[110];
int main()
{
	int n,p,q;
	scanf("%d %d %d",&n,&p,&q);
	scanf("%s",&str);
	for(int i=0;i<100;i++)
	{
		for(int j=0;j<100;j++)
		{
			if( i*p+j*q==strlen(str) )
			{
				printf("%d\n",i+j);
				for(int k=0;k<i;k++)
				{
					for(int t=0;t<p;t++)
						printf("%c",str[k*p+t]);
					printf("\n");
				}
				for(int k=0;k<j;k++)
				{
					for(int t=0;t<q;t++)
						printf("%c",str[i*p+k*q+t]);
					printf("\n");
				}
				return 0;
			}
		}
	}
	return puts("-1");
}