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

def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def MAP2():return map(float,input().split())
def LIST(): return list(map(int, input().split()))
def STRING(): return input()
import string
import sys
from heapq import heappop , heappush
from bisect import *
from collections import deque , Counter , defaultdict
from math import *
from itertools import permutations , accumulate
dx = [-1 , 1 , 0 , 0  ]
dy = [0 , 0  , 1  , - 1]
#visited = [[False for i in range(m)] for j in range(n)]
#  primes = [2,11,101,1009,10007,100003,1000003,10000019,102345689]
#sys.stdin = open(r'input.txt' , 'r')
#sys.stdout = open(r'output.txt' , 'w')
#for tt in range(INT()):
#arr.sort(key=lambda x: (-d[x], x)) Sort with Freq

#Code

n , p , q = MAP()
s = STR()
ans = []
r1 , r2 = 0 , 0
for i in range(n + 1):
    x1 = i * p
    x2 = n - x1
    x3 = x2 % q
    if x3 == 0 :
        r1 = i
        r2 = x2 // q
        break

if r1 == r2 == 0 or r1 < 0 or r2 < 0 :
    print('-1')
    exit(0)

x , y = r1 , r2
v1 = ''
for i in range(0 , r1*p):
    v1 += s[i]
    if len(v1) == p :
        ans.append(v1)
        v1 = ''

v2 = ''
for i in range(r1*p , n):
    v2 += s[i]
    if len(v2) == q:
        ans.append(v2)
        v2 = ''

if len(ans) == r1 + r2 :
    print(len(ans))
    for i in ans:
        print(i)
else:
    print('-1')


