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.

Input

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.

Output

Print k lines, each of which contains no less than a and no more than b symbols — Anfisa's text divided into lines. It is not allowed to perform any changes in the text, such as: deleting or adding symbols, changing their order, etc. If the solution is not unique, print any of them. If there is no solution, print "No solution" (without quotes). 

Examples

Input

3 2 5
abrakadabra


Output

ab
rakad
abra


Input

4 1 2
abrakadabra


Output

No solution
'use strict'

const getLine = () => readline().split(' ')
const getInts = () => getLine().map(n => parseInt(n))
const getInt = () => getInts()[0]
const D = (...args) => { // D({name})
  [...args].forEach(cur => print.apply(print, [JSON.stringify(cur)]))
}

main()

function main() {
  const inp = getInts()
  let s = getLine()[0]
  solve(s, ...inp)
}

function solve (s, k, a, b) {
  let n = s.length
  const dp = []
  for (let i = 0; i <= k; ++i) {
    dp.push([])
  }

  for (let i = 0; i <= k; ++i) {
    for (let j = 0; j <= n; ++j) {
      dp[i][j] = 0
    }
  }
  
  for (let i = a; i <= b; ++i) dp[1][i] = 1

  for (let i = 2; i <= k; ++i) {
    for (let j = i * a; j <= i * b && j <= n; ++j) {
      dp[i][j] = 1
    }
  }

  if (dp[k][n] === 0) print('No solution')
  else {
    const path = []
    for (let i = k; i > 1; --i) {
      for (let j = a; j <= b; ++j) {
        const val = n - j
        if (dp[i - 1][val]) {
          path.push(j)
          n -= j
          break
        }
      }
    }

    path.push(n)
    let ind = 0
    for (let i in path) {
      print(s.slice(ind, ind + path[i]))
      ind += path[i]
    }
  }
}
