Iroha has a sequence of N strings s_1, s_2, ..., s_N.

She will choose some (possibly all) strings from the sequence, then concatenate those strings retaining the relative order, to produce a long string.

Among all strings of length K that she can produce in this way, find the lexicographically smallest one.

Constraints

* 1 ≦ N ≦ 2000
* 1 ≦ K ≦ 10^4
* For each i, 1 ≦ |s_i| ≦ K.
* |s_1| + |s_2| + ... + |s_N| ≦ 10^6
* For each i, s_i consists of lowercase letters.
* There exists at least one string of length K that Iroha can produce.

Input

The input is given from Standard Input in the following format:


N K
s_1
s_2
:
s_N


Output

Print the lexicographically smallest string of length K that Iroha can produce.

Examples

Input

3 7
at
coder
codar


Output

atcodar


Input

3 7
coder
codar
at


Output

codarat


Input

4 13
kyuri
namida
zzzzzzz
aaaaaa


Output

namidazzzzzzz
#include<bits/stdc++.h>
 #define N (2009)
 #define K (10009)
 #define S (1000009)
 using namespace std;
 
 int n,k,cnt,len[N];
 char s[N][K];
 bitset<K>f[N];
 pair<int,int>v[2][K];
 
 int main()
 {
     cin>>n>>k;
     for (int i=1; i<=n; ++i)
         cin>>s[i], len[i]=strlen(s[i]);
     f[n+1][0]=1;
     for (int i=n; i>=1; --i)
         f[i]=f[i+1]|(f[i+1]<<len[i]);
     for (int i=1; i<=n; ++i)
         if (f[i+1][k-len[i]])
             v[0][++cnt]=make_pair(i,0);
     for (int i=1; i<=k; ++i)
     {
         char Min='z'; int ncnt=0;
         for (int j=1; j<=cnt; ++j)
             Min=min(Min,s[v[i-1&1][j].first][v[i-1&1][j].second]);
         putchar(Min);
         int ID=n+1;
         for (int j=1; j<=cnt; ++j)
         {
             int id=v[i-1&1][j].first,pos=v[i-1&1][j].second;
             if (s[id][pos]!=Min) continue;
             if (pos<len[id]-1) v[i&1][++ncnt]=make_pair(id,pos+1);
             else ID=min(ID,id);
         }
         for (int j=ID+1; j<=n; ++j)
             if (k-i-len[j]>=0 && f[j+1][k-i-len[j]])
                 v[i&1][++ncnt]=make_pair(j,0);
         cnt=ncnt;
     }
}