Problem: Advertising has become part of our routine. And now, in the era of progressive technologies, we need your ideas to make advertising better!

In this problem we'll look at a simplified version of context advertising. You've got a text, consisting of exactly n words. A standard advertising banner has exactly r lines, each line can contain at most c characters. The potential customer always likes it when they can see lots of advertising, so you should determine which maximum number of consecutive words from the text can be written on the banner. Single words in one line of the banner should be separated by spaces. You are allowed to insert more than one space at once. Note that you are not allowed to break the words, that is, each word in the text must occupy exactly one line in the banner. Besides, you cannot change the word order, that is, if you read the banner text consecutively, from top to bottom and from left to right, you should get some consecutive part of the advertisement text.

More formally, the statement can be written like that. Let's say that all words are indexed from 1 to n in the order in which they occur in the advertisement text. Then you have to choose all words, starting from some i-th one and ending with some j-th one (1 ≤ i ≤ j ≤ n), so that all of them could be written on the banner. There must be as many words as possible. See the samples for clarifications.

Input

The first input line contains three integers n, r, c (1 ≤ n, r, c ≤ 106; r × c ≤ 106). The next line contains a text, consisting of n words. The words consist only of lowercase English letters and are not empty. The words in the lines are separated by single spaces. The total number of characters in all words doesn't exceed 5·106.

Output

Print at most r lines, in each line print at most c characters — the optimal advertisement banner. If there are multiple advertisement banners, print any of them. 

Note that some lines of the banner can be empty. You are allowed not to print such lines.

Examples

Input

9 4 12
this is a sample text for croc final round


Output

this is a
sample text
for croc
final round


Input

9 1 9
this is a sample text for croc final round


Output

this is a


Input

6 2 3
croc a a a croc a


Output

a a
a


Input

2 2 5
first second


Output

first

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
template <class T>
void _db(const char* dbStr, T e) {
  cout << dbStr << " = " << e << endl;
}
template <class T, class... L>
void _db(const char* dbStr, T e, L... r) {
  while (*dbStr != ',') cout << *dbStr++;
  cout << " = " << e << ',';
  _db(dbStr + 1, r...);
}
template <class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
  o << "[";
  int i = 0;
  for (const pair<S, T>& pr : v)
    o << (!i++ ? "" : ", ") << "{" << pr.first << " : " << pr.second << "}";
  return o << "]";
}
template <template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
  o << "[";
  int i = 0;
  for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
  return o << "]";
}
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
  return o << "(" << pr.first << ", " << pr.second << ")";
}
ostream& operator<<(ostream& o, const string& s) {
  for (const char& c : s) o << c;
  return o;
}
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;
int n, r, c;
V<string> s;
vi sum;
vvi adj;
vi path;
pii ans = make_pair(0, 0);
bool good(int i, int j) { return sum[j] - sum[i - 1] + (j - i) > c; }
void dfs(int u, int p) {
  path.push_back(u);
  int l = path[max(int(path.size()) - 1 - r, 0)] - u;
  true;
  if (l > ans.first) ans = make_pair(l, u);
  for (auto& v : adj[u]) {
    if (v != p) dfs(v, u);
  }
  path.pop_back();
}
int main() {
  ios::sync_with_stdio(false);
  cout.precision(10);
  cin.tie(0);
  cin >> n >> r >> c;
  s.assign(n + 2, "");
  sum.assign(n + 2, 0);
  adj.assign(n + 2, vi());
  for (int i = 1; i <= n; ++i) {
    cin >> s[i];
    sum[i] = sum[i - 1] + int(s[i].size());
  }
  sum.back() = OO;
  vi next(n + 2, n + 1);
  for (int i = 1; i <= n; ++i) {
    int lo = i, hi = n + 1;
    while (lo < hi) {
      int mid = (lo + hi) / 2;
      if (good(i, mid))
        hi = mid;
      else
        lo = mid + 1;
    }
    true;
    next[i] = lo;
    adj[next[i]].push_back(i);
  }
  true;
  for (int i = 1; i <= n + 1; ++i) {
    if (next[i] == i) dfs(i, i);
  }
  true;
  if (!ans.first)
    cout << '\n';
  else {
    for (int l = ans.second, r = ans.second + ans.first, Sz = int(s[l].size());
         l < r; ++l) {
      cout << s[l];
      if (l + 1 == r || (l + 1 < r && Sz + 1 + int(s[l + 1].size()) > c)) {
        cout << '\n';
        Sz = int(s[l + 1].size());
      } else {
        cout << ' ';
        Sz += 1 + int(s[l + 1].size());
      }
    }
  }
  return 0;
}