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
import java.util.*;
import java.io.*;
public class Main
{
    static class Reader 
    { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
  
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    }
    public static long gcd(long a,long b)
    { 
        if(b%a==0)
        return a;
        return gcd(b%a,a);
    }
    static class Pair
    {
        int f,s;
        Pair(int f,int s)
        {
            this.f=f;
            this.s=s;
        }
    }
    public static long pow(long a,int pow,long m)
    {
        long ans=a;
        long res=1;
        while(pow>0)
        {
            if(pow%2!=0)
            {
                pow--;
                res=res*ans;
                res%=m;
            }
            else
            {
                ans=ans*ans;
                ans%=m;
                pow/=2;
            }
        }
        return res;
    }
    public static void main(String args[])throws Exception
    {
        //Reader sc=new Reader();
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw=new PrintWriter(System.out);
        int t=1;//sc.nextInt();
        while(t-->0)
        {
            String str[]=br.readLine().split(" ");
            int n=Integer.parseInt(str[0]);
            int l=Integer.parseInt(str[1]);
            int k=Integer.parseInt(str[2]);
            char carr[]=new char[n*l];
            carr=br.readLine().toCharArray();
            Arrays.sort(carr);
            char ans[][]=new char[n][l];
            int in=-1;
            if(k==1)
            {
                for(int i=0;i<l;i++)
                ans[0][i]=carr[++in];
                for(int i=1;i<n;i++)
                {
                    for(int j=0;j<l;j++)
                    ans[i][j]=carr[++in];
                }
            }
            else
            {
                int cnt[]=new int[26];
                for(int i=0;i<carr.length;i++)
                cnt[carr[i]-'a']++;
                int ind[]=new int[n];
                int i=0;
                while(i<carr.length)
                {
                    if(cnt[carr[i]-'a']>=k)
                    {
                        int avail=Math.min(l,cnt[carr[i]-'a']/k);
                        int m=cnt[carr[i]-'a']%k;
                        char c=carr[i];
                        for(int j=0;j<avail;j++)
                        {
                            for(int p=0;p<k;p++)
                            {
                                ans[p][ind[p]]=c;
                                ind[p]++;
                                i++;
                            }
                        }
                        if(m!=0)
                        {
                            if(avail!=l)
                            {
                                for(int j=0;j<k-1;j++)
                                {
                                    ans[j][ind[j]]=carr[i++];
                                    ind[j]++;
                                }
                            }
                            for(int j=avail;j<l;j++)
                            {
                                ans[k-1][j]=carr[i++];
                                ind[k-1]++;
                            }
                            for(int j=0;j<k-1;j++)
                            {
                                for(int p=avail;p<l;p++)
                                ans[j][ind[j]++]=carr[i++];
                            }
                            for(int j=k;j<n;j++)
                            {
                                for(int p=0;p<l;p++)
                                {
                                    ans[j][ind[j]]=carr[i++];
                                    ind[j]++;
                                }
                            }
                        }
                    }
                    else
                    {
                        for(int j=0;j<=k-1;j++)
                        {
                            ans[j][ind[j]++]=carr[i++];
                        }
                        for(int j=1;j<l;j++)
                        ans[k-1][j]=carr[i++];
                        for(int j=0;j<k-1;j++)
                        {
                            for(int p=1;p<l;p++)
                            ans[j][ind[j]++]=carr[i++];
                        }
                        for(int j=k;j<n;j++)
                        {
                            for(int p=0;p<l;p++)
                            ans[j][ind[j]++]=carr[i++];
                        }
                    }
                }
            }
            for(int i=0;i<n;i++)
            pw.println(new String(ans[i]));
        }
        pw.flush();
        pw.close();
    }
}