The Text Splitting CodeForces - 612A

The Text Splitting

CodeForces - 612A

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.

Example

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

code：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
    string s;
    int n,p,q;
    cin >> n >> p >> q;
    cin >> s;
    int len=s.size();
    int cnt=0;
    while(len>=0){
        if(len%p==0) break;
        cnt++;
        len-=q;
    }
    if(len<0) cout << -1 << endl;
    else{
        int cntt=len/p;
        int index=0;
        cout << cntt+cnt << endl;
        for(int i=1; i<=cntt; i++){
            cout << s.substr(index, p) << endl;
            index+=p;
        }
        for(int i=1; i<=cnt; i++){
            cout << s.substr(index, q) << endl;
            index+=q;
        }
    }
    return 0;
}