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.util.*;
import java.io.*;
public class Main {
      static class pair implements Comparable<pair>{
        int x;
        int y;
        public pair(int x, int y){
            this.x=x;
            this.y=y;
        }
        public int compareTo(pair p){
            return (x-p.x==0)?p.y-y:x-p.x;
        }
    }
  public static void main(String[] args) throws IOException,InterruptedException{
	BufferedReader	 br = new BufferedReader(new InputStreamReader(System.in));
	PrintWriter out = new PrintWriter(System.out);
     	// String s = br.readLine();
        // char[] arr=s.toCharArray();
        // ArrayList<Integer> arrl = new ArrayList<Integer>(); 
        // TreeSet<Integer> ts1 = new TreeSet<Integer>(); 
        // HashSet<Integer> h = new HashSet<Integer>(); 
        // HashMap<Integer, Integer> map= new HashMap<>(); 
        // PriorityQueue<String> pQueue = new PriorityQueue<String>(); 
        // LinkedList<String> object = new LinkedList<String>(); 
        // StringBuilder str = new StringBuilder(); 
 	    StringTokenizer   st = new StringTokenizer(br.readLine());
 	      int k = Integer.parseInt(st.nextToken());
 	      int a = Integer.parseInt(st.nextToken());
 	      int b = Integer.parseInt(st.nextToken());
          String s = br.readLine();
          char[] arr=s.toCharArray();
          int n = arr.length;
          int c=(n%k==0)?n/k:n/k+1;
          if(c>b||c<a){
              out.print("No solution");
          }else{
            int i=0;
            int x =n;
            for(int l = b; l>=a; l--){
            while((x-l)>=(a*(k-1))){
                int j =0;
                while(j<l&&i<n){
                    out.print(arr[i]);
                    i++;
                    j++;
                }
                x-=l;
                k--;
                if(k==0){ out.flush(); return;}
                out.println();
            }
            }
            if(i==0){
                out.print("No solution");
            }
          }
          out.flush();
 
	}}