#include <bits/stdc++.h>
using namespace std;
int n, l, t;
char s[1005 * 1005];
int len;
string st[1005];
int main() {
  scanf("%d%d%d", &n, &l, &t);
  scanf("%s", &s);
  len = n * l;
  sort(s, s + len);
  int piv = 0;
  int pos = 0;
  while (pos < len && piv < (t - 1)) {
    if (st[t - 1].size() == l) {
      break;
    }
    for (int i = piv; i < t; i++) {
      st[i] += s[pos++];
    }
    while (piv < (t - 1) && st[piv] < st[t - 1]) piv++;
  }
  while (st[t - 1].size() < l) st[t - 1] += s[pos++];
  for (int i = 0; i < n; i++) {
    while (st[i].size() < l) st[i] += s[pos++];
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < l; j++) printf("%c", st[i][j]);
    printf("\n");
  }
  return 0;
}

### Prompt

Your challenge is to write a Cpp solution to the following problem:

Lucy likes letters. She studied the definition of the lexicographical order at school and plays with it.

At first, she tried to construct the lexicographically smallest word out of given letters. It was so easy! Then she tried to build multiple words and minimize one of them. This was much harder!

Formally, Lucy wants to make n words of length l each out of the given n ⋅ l letters, so that the k-th of them in the lexicographic order is lexicographically as small as possible.

Input

The first line contains three integers n, l, and k (1≤ k ≤ n ≤ 1 000; 1 ≤ l ≤ 1 000) — the total number of words, the length of each word, and the index of the word Lucy wants to minimize.

The next line contains a string of n ⋅ l lowercase letters of the English alphabet.

Output

Output n words of l letters each, one per line, using the letters from the input. Words must be sorted in the lexicographic order, and the k-th of them must be lexicographically as small as possible. If there are multiple answers with the smallest k-th word, output any of them.

Examples

Input


3 2 2
abcdef


Output


af
bc
ed

Input


2 3 1
abcabc


Output


aab
bcc

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int n, l, t;
char s[1005 * 1005];
int len;
string st[1005];
int main() {
  scanf("%d%d%d", &n, &l, &t);
  scanf("%s", &s);
  len = n * l;
  sort(s, s + len);
  int piv = 0;
  int pos = 0;
  while (pos < len && piv < (t - 1)) {
    if (st[t - 1].size() == l) {
      break;
    }
    for (int i = piv; i < t; i++) {
      st[i] += s[pos++];
    }
    while (piv < (t - 1) && st[piv] < st[t - 1]) piv++;
  }
  while (st[t - 1].size() < l) st[t - 1] += s[pos++];
  for (int i = 0; i < n; i++) {
    while (st[i].size() < l) st[i] += s[pos++];
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < l; j++) printf("%c", st[i][j]);
    printf("\n");
  }
  return 0;
}

```