Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into *k* lines not shorter than *a* and not longer than *b*, for the text to resemble human speech more. Help Anfisa.
The first line contains three integers *k*, *a* and *b* (1 ≤ *k* ≤ 200, 1 ≤ *a* ≤ *b* ≤ 200). The second line contains a sequence of lowercase Latin letters — the text typed by Anfisa. It is guaranteed that the given line is not empty and its length does not exceed 200 symbols.
# import sys, os
# sys.stdin = open(os.path.join(sys.path[0], "input.txt"), "r")
# sys.stdout = open(os.path.join(sys.path[0], "output.txt"), "w")


k, a, b = map(int, input().split())
string = input()
splits = []
def find_splits(index, k):
    if(index == len(string) and k == 0):
        return True
    if(k == 0 or index == len(string)):
        return False
    for i in range(a, min(b + 1, len(string) - index + 1)):
        splits.append(string[index: index + i])
        # print(index, splits)
        if(find_splits(index + i, k - 1)):
            return True
        splits.pop()
    return False


if(len(string) <= k * b):
    index = 0
    find_splits(0, k)
    for split in splits:
        print(split)
else:
    print("No solution")

            






        







    


