Anfisa the monkey learns to type. She is yet unfamiliar with the "space" key and can only type in lower-case Latin letters. Having typed for a fairly long line, Anfisa understood that it would be great to divide what she has written into k lines not shorter than a and not longer than b, for the text to resemble human speech more. Help Anfisa.

Input

The first line contains three integers k, a and b (1 ≤ k ≤ 200, 1 ≤ a ≤ b ≤ 200). The second line contains a sequence of lowercase Latin letters — the text typed by Anfisa. It is guaranteed that the given line is not empty and its length does not exceed 200 symbols.

Output

Print k lines, each of which contains no less than a and no more than b symbols — Anfisa's text divided into lines. It is not allowed to perform any changes in the text, such as: deleting or adding symbols, changing their order, etc. If the solution is not unique, print any of them. If there is no solution, print "No solution" (without quotes). 

Examples

Input

3 2 5
abrakadabra


Output

ab
rakad
abra


Input

4 1 2
abrakadabra


Output

No solution
import java.io.*;
import java.util.*;
import java.lang.*;
public class Codechef {
	PrintWriter out;
    StringTokenizer st;
    BufferedReader br;
 	
 	class Pair implements Comparable<Pair>
	{
	    int f;
	    int s;
 
	    Pair(int t, int r) {
	       f = t;
	       s = r;
	    }
	    public int compareTo(Pair p)
	    {
	    	if(this.f!=p.f)
	    		return this.f-p.f;
 
	    	return this.s-p.s;
	    }
 	}
 // 	class Sort implements Comparator<String> 
	// { 
	//     public int compare(String a, String b) 
	//     { 
	//     	return (a+b).compareTo(b+a);
	//     } 
	// }
 
	String ns() {
        while (st == null || !st.hasMoreElements()) {
 
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }
 
    String nextLine() throws Exception {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            throw new Exception(e.toString());
        }
        return str;
    }
 
    int nextInt() {
        return Integer.parseInt(ns());
    }
 
    long nextLong() {
        return Long.parseLong(ns());
    }
 
    double nextDouble() {
        return Double.parseDouble(ns());
    }
	
	int upperBound(long a[],long key)
	{
		int l=0,r=a.length-1;
		int i=-1;
 
		while(l<=r)
		{
			int mid=(l+r)/2;
 
			if(a[mid]<key)
				l=mid+1;
 
			else{
				i=mid;	
				r=mid-1;
			}
			
		}
		return i;
	}
	// int lowerBound(ArrayList<Integer> a,int key)
	// {
	// 	int l=0,r=a.size()-1;
	// 	int i=-1;
 
	// 	while(l<=r)
	// 	{
	// 		int mid=(l+r)/2;
 
	// 		if(a.get(mid)<=key)
	// 		{
	// 			i=mid;
	// 			l=mid+1;	
	// 		}
 
	// 		else
	// 			r=mid-1;
			
	// 	}
	// 	return i;
	// }
 
	long power(long x,long y)
	{
	    long ans=1;
	    
	    while(y!=0)
	    {
	        if(y%2==1) ans=(ans*x)%mod;
	        x=(x*x)%mod;
	        y/=2;
	    }
	    return ans%mod;
	}
	
 
	int mod= 1000000007;
	long gcd(long x ,long y)
	{
		if(y==0)
			return x;
		return gcd(y,x%y);
	}
 
	// ArrayList a[];
	// int vis[],cnt=0;
	// void dfs(int ver)
	// {
	// 	ArrayList<Integer> l=a[ver];
	// 	if(l.size()==1)
	// 		cnt++;
	// 	for(int v:l)
	// 	{
	// 		if(vis[v]==0){
	// 			vis[v]=vis[ver]+1;
	// 			dfs(v);
	// 		}
	// 	}
	// }
 
 
	
	void solve() throws IOException{
		int k = nextInt();
		int a = nextInt();
		int b = nextInt();
		String s = ns();
		int n=s.length();

		if(n>b*k||n<a*k){
			out.println("No solution");
			return;
		}
		//System.out.println(n);
		int l=0;
		while(k!=0)
		{
			int m=b;

			if(n-b<a*(k-1))
				m=n-a*(k-1);
			
			out.println(s.substring(l,l+m));
			l+=m;
			n-=m;
			k--;
		}

	}

	
    void run() throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
		solve();
		out.flush();
 
		out.close();
	}
 
	public static void main(String args[]) throws IOException {
		new Codechef().run();
	}
  
}
 
/*
int n=nextInt();
		long sum=nextLong();
		Long a[]= new Long[n];
		long pre[]= new long[n+1];
		for(int i=0;i<n;i++)
			a[i]=nextLong();
		Arrays.sort(a);
 
		for(int i=0;i<n;i++)
		{
			if(i==0)
				pre[i]=a[i];
			else
				pre[i]=pre[i-1]+a[i];
		}
		out.println(Arrays.toString(pre));
		long total=pre[0];
		long cnd=1;
		for(int i=1;i<n;i++)
		{
			if(a[i]>total)
			{
				long t=a[i]-total;
				out.println(((t-1)/pre[i-1])*pre[i-1]+" hey");
				total+=((t-1)/pre[i-1])*pre[i-1];
				cnd+=((t-1)/pre[i-1])*i;
				out.println(total+" "+cnd);
				t=a[i]-total;
				int j=upperBound(pre,t);
				cnd+=j+1;
				total+=pre[j];
			}
		
			total+=a[i];
			cnd++;
	 		out.println(total);
		}
 
		*/
 
	/*
 
	int n=nextInt();
	int k=nextInt();
	int a[]= new int[k+1];
 
	ArrayList<Integer> list = new ArrayList<>();
	for(int i=0;i<n;i++)
		a[nextInt()]++;
	for(int i=0;i<k;i++)
		list.add(a[i+1]);
	Collections.sort(list);
 
	out.println(list);
 
	int l=list.get(list.size()-1),r=l*2;
	int min=Integer.MAX_VALUE;
	for(int i=l;i<=r;i++)
	{
		int j=lowerBound(list,i-list.get(0));
		out.println("lowerBound "+j);
		if(j==-1)
		{
			min=Math.min(min,list.size()*i);
			out.println(list.size()*i);
		}
		else
		{
			min=Math.min(min,(list.size()-(j+1)/2)*i);
			out.println((list.size()-(j+1)/2)*i+" hey");
		}
 
	}
	out.println(min);
	
	*/









