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/env python3
# -*- coding: utf-8 -*-
"""
Created on Mon Jun 22 12:21:42 2020

@author: shailesh
"""

def print_string_segments(s,p,p_num,q,q_num):
    l  =[]
    for i in range(p_num):
        l.append(s[p*i:p*(i+1)])
    for i in range(q_num):
        l.append(s[p*p_num + q*i:p*p_num + q*(i+1)])
    
    
    print(len(l))
    for st in l:
        print(st)

n,p,q = [int(i) for i in input().split()]
s = input()
flag = 0

if n%p == 0:
    p_num = n//p
    q_num = 0
    flag = 1

elif n%q == 0:
    p_num = 0
    q_num = n//q
    flag = 1
else:
    for multiplier in range(1,n//p + 1):
        if (n - multiplier*p)%q == 0:
            p_num = multiplier
            q_num = (n-multiplier*p)//q
            flag = 1
    
if flag:
    
    print_string_segments(s,p,p_num,q,q_num)
else:
    print(-1)