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
#include<bits/stdc++.h>
// use gp_hash_table<int,int,custom_hash> m;
// in place of map
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define rep(i,n) for(int i=0;i<n;++i)
#define repa(i,a,n) for(int i=a;i<n;++i)
#define repr(i,n) for(int i=n-1;i>=0;--i)
#define repba(i,b,a) for(int i=b;i>=a;--i)
#define repab(i,a,b) for(int i=a;i<b;++i)
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define msi map<string,int>
#define mii map<int,int>
#define viip vector<pair<pair<int,int> >,int>
#define mp make_pair
#define vip vector<pair<int,int> >
#define pb push_back 
#define po pop_back
#define fi first
#define sec second
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define s(v) v.size()
ll mod = 1000000007;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());//use rng()%n for numbers in range [0,n-1]
// This custom_hash is for unordered_map 
// use map<int, int, custom_hash> mp;

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
ll gcd(ll a,ll b){
	if(b==0)return a;
	return gcd(b,a%b);
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	#ifndef ONLINE_JUDGE
    	freopen("input.txt", "r", stdin);
    	freopen("output.txt", "w", stdout);
	#endif
	int n,l,k;
	cin>>n>>l>>k;
	string s;
	cin>>s;
	// int i=1;
	vi c(26,0);
	rep(i,s(s)){
		c[s[i]-'a']++;
	}
	// rep(i,26){
	// 	cout<<c[i]<<" ";
	// }
	string ans[n];
	rep(i,n){
		rep(j,l){
			ans[i].pb('A');
		}
	}
	// int count=0;
	rep(i,k){
		rep(j,26){
			// cout<<j;
			// if(i==2)
			if(c[j]!=0){ans[i][0]=j+'a';c[j]--;break;}
		}
	}
	// cout<<ans[2][0]<<" ";
	int start=0;
	for(int i=k-1;i>=0;i--){
		if(ans[k-1][0]==ans[i][0]){
			continue;
		}
		else{
			start = i+1;
			break;
		}
	}
	// cout<<start;
	rep(x,l-1){
		// cout<<x<<" ";
		if(start>=k-1){
			break;
		}
		// cout<<"*";
		for(int i=start;i<=k-1;i++){
			// cout<<i<<" ";
			rep(j,26){
				if(c[j]!=0){ans[i][x+1]=j+'a';c[j]--;break;}
			}
		}
		for(int i=k-1;i>0;i--){
			if(ans[i][x+1]==ans[i-1][x+1]){
				continue;
			}
			else{
				start = i+1;
			}
		}	
	}
	// rep(i,n){
	// 	cout<<ans[i]<<" ";
	// }
	// cout<<c[1]<<" ";
	// repr(i,k){
		rep(j,l){
			// cout<<s[i]
			if(ans[k-1][j]!='A')continue;
			rep(x,26){
				// cout<<i<<j<<x<<c[x]<<" ";
				if(c[x]!=0){ans[k-1][j]=x+'a';c[x]--;break;}
			}
		}
	// }
	rep(i,k-1){
		rep(j,l){
			// cout<<s[i]
			if(ans[i][j]!='A')continue;
			rep(x,26){
				// cout<<i<<j<<x<<c[x]<<" ";
				if(c[x]!=0){ans[i][j]=x+'a';c[x]--;break;}
			}
		}
	}
	repa(i,k,n){
		rep(j,l){
			rep(x,26){
				if(c[x]!=0){ans[i][j]=x+'a';c[x]--;break;}
			}
		}
	}
	rep(i,n){
		cout<<ans[i]<<"\n";
	}
	// rep(x,l-1){
	// 	repr(i,k){
	// 		rep(j,26){
	// 			if(c[j]!=0){ans[i][x+1]}
	// 		}
	// 	}
	// }
	// while(i<k){
	// 	char poss;
	// 	rep(j,26){
	// 		if(c[j]!=0){
	// 			poss = j+'a';
	// 			c[j]--;
	// 			break;
	// 		}
	// 	}
	// 	string tmp;
	// 	rep(z,l-1){
	// 		repr(j,26){
	// 			if(c[j]!=0){
	// 				tmp.pb('a'+j);
	// 				c[j]--;
	// 				break;
	// 			}
	// 		}
	// 	}
	// 	sort(all(tmp));
	// 	cout<<poss<<tmp<<"\n";
	// 	// tmp = poss + 'a'
	// 	i++;
	// }
	// string tmp;
	// rep(z,l){
	// 	rep(j,26){
	// 		if(c[j]!=0){
	// 			tmp.pb('a'+j);
	// 			c[j]--;
	// 			break;
	// 		}
	// 	}
	// }
	// cout<<tmp<<"\n";
	// i++;
	// while(i<n){
	// 	char poss;
	// 	rep(j,26){
	// 		if(c[j]!=0){
	// 			poss = j+'a';
	// 			c[j]--;
	// 			break;
	// 		}
	// 	}
	// 	string tmp;
	// 	rep(z,l-1){
	// 		repr(j,26){
	// 			if(c[j]!=0){
	// 				tmp.pb('a'+j);
	// 				c[j]--;
	// 				break;
	// 			}
	// 		}
	// 	}
	// 	sort(all(tmp));
	// 	cout<<poss<<tmp<<"\n";
	// 	// tmp = poss + 'a'
	// 	i++;
	// }
	return 0;
}