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
#!/usr/bin/python3

import sys
import string
import math

def find_mcd(n, p, q):
    if n < p and n < q:
        return -1, -1
    if n % p == 0:
        return n / p, 0
    if n % q == 0:
        return 0, n / q
    i = n // p + 1
    j = 0
    while j < n // q + 1:
        x = p * i + j * q
        if x == n:
            return i, j
        elif x > n:
            i -= 1
        else:
            j += 1

    return -1, -1


def text_split(text, p, q):
    ip, jq = find_mcd(len(text), p, q)
    if ip < 0 and jq < 0:
        return False
    res = []
    i = 0
    while ip > 0:
        ip -= 1
        res.append(text[i:i+p])
        i += p
    while jq > 0:
        jq -= 1
        res.append(text[i:i+q])
        i += q
    return res

if __name__ == '__main__':
    assert text_split('hello', 2, 3) == ['he', 'llo']
    assert text_split('hello', 3, 2) == ['hel', 'lo']
    assert text_split('Codeforces', 9, 5) == ['Codef', 'orces']
    assert text_split('Privet', 4, 5) == False
    assert text_split('abacabac', 1, 1) == ['a', 'b', 'a', 'c', 'a', 'b', 'a', 'c']

    n, p, q = [int(d) for d in sys.stdin.readline().rstrip('\n').split(' ')]
    s = sys.stdin.readline().rstrip('\n')
    res = text_split(s, p, q)
    if res == False:
        print("-1")
    else:
        print(len(res))
        print('\n'.join(res))
