The only difference between the easy and the hard versions is constraints.

A subsequence is a string that can be derived from another string by deleting some or no symbols without changing the order of the remaining symbols. Characters to be deleted are not required to go successively, there can be any gaps between them. For example, for the string "abaca" the following strings are subsequences: "abaca", "aba", "aaa", "a" and "" (empty string). But the following strings are not subsequences: "aabaca", "cb" and "bcaa".

You are given a string s consisting of n lowercase Latin letters.

In one move you can take any subsequence t of the given string and add it to the set S. The set S can't contain duplicates. This move costs n - |t|, where |t| is the length of the added subsequence (i.e. the price equals to the number of the deleted characters).

Your task is to find out the minimum possible total cost to obtain a set S of size k or report that it is impossible to do so.

Input

The first line of the input contains two integers n and k (1 ≤ n, k ≤ 100) — the length of the string and the size of the set, correspondingly.

The second line of the input contains a string s consisting of n lowercase Latin letters.

Output

Print one integer — if it is impossible to obtain the set S of size k, print -1. Otherwise, print the minimum possible total cost to do it.

Examples

Input


4 5
asdf


Output


4


Input


5 6
aaaaa


Output


15


Input


5 7
aaaaa


Output


-1


Input


10 100
ajihiushda


Output


233

Note

In the first example we can generate S = { "asdf", "asd", "adf", "asf", "sdf" }. The cost of the first element in S is 0 and the cost of the others is 1. So the total cost of S is 4.
import java.io.BufferedReader;
import java.io.*;
import java.util.*;

public class h {

    static BufferedReader br;
    static long mod = 1000000000 + 7;
    static HashSet<Integer> p = new HashSet<>();
     static boolean debug =true;
           //  Arrays.sort(time  , (a1,a2) -> (a1[0]-a2[0])); 2d array sort lamda
    public static void main(String[] args) throws Exception {
        br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pr = new PrintWriter(System.out);
        int tc = 1;
       // tc = cinI();
       // while (tc-- > 0) {

            long[] nk = readArray(2,0);
            int n  =(int)nk[0];
            long k=nk[1];

            char[] a  =cin().toCharArray();

            HashSet<Character> present =new HashSet<>();

            long[][] dp =new long[n][n+1];

            dp[0][1]=1;

            present.add(a[0]);

            for(int i=1;i<n;i++){

            	if(present.contains(a[i])==true){

            		for(int j=i-1;j>=0;j--){
                   
                        for(int len=1;len<n;len++){
                        	dp[i][len+1]+=dp[j][len];
                        }
                        if(a[i]==a[j]){
                        	break;
                        }

            		}
            	}
            	else{
            		present.add(a[i]);
            		for(int j=i-1;j>=0;j--){
                   
                        for(int len=1;len<n;len++){
                        	dp[i][len+1]+=dp[j][len];
                        }
                        

            		}
            		dp[i][1]=1;
            	}
            }
            long[] ans=new long[n+1];

            for(int i=0;i<n;i++){

            	for(int j=1;j<=n;j++){
            		ans[j]+=dp[i][j];
            	//	System.out.print(dp[i][j]+" ");
            	}
            	//System.out.println();
            }
            long cost=0;
            for(int i=n;i>=1;i--){
            	//System.out.println(ans[i]+" "+cost+" "+k);
                if(k==0){
                	break;
                }
               if(k>=ans[i]){
                cost+=((n-i)*(ans[i]));
                k-=ans[i];

               }else{
               	 cost+=((n-i)*k);
               	 k=0;
               	 break;
               }

            }
            if(k==1){
            	cost+=n;
            	System.out.println(cost);
            	return ;
            }
            else if(k!=0){
                System.out.println(-1);
            }
            else{
            	System.out.println(cost);
            }
       
    }

    public static <E> void print(String var ,E e){
      if(debug==true){
      System.out.println(var +" "+e);
      }
    }
     private static long[]  sort(long[] e){
     ArrayList<Long> x=new ArrayList<>();
     for(long c:e){
       x.add(c);
     }
     Collections.sort(x);
     long[] y = new long[e.length];
     for(int i=0;i<x.size();i++){
       y[i]=x.get(i);
     }
     return y;
     }
    public static void printDp(long[][] dp) {

        int n = dp.length;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < dp[0].length; j++) {
                System.out.print(dp[i][j] + " ");
            }
            System.out.println();
        }
    }

    


  

    private static long gcd(long a, long b) {
        if (a == 0)
            return b;
        if (b == 0)
            return a;

        // base case
        if (a == b)
            return a;

        // a is greater
        if (a > b)
            return gcd(a % b, b);
        return gcd(a, b % a);
    }


    public static long min(long a, long b) {
        return Math.min(a, b);
    }

    public static int min(int a, int b) {
        return Math.min(a, b);
    }


    public static void sieve() {
        int[] pf = new int[100000000 + 1];
        //0 prime //1 not prime
        pf[0] = 1;
        pf[1] = 1;
        for (int j = 2; j <= 10000; j++) {

            if (pf[j] == 0) {
                p.add(j);
                for (int k = j * j; k < pf.length; k += j) {
                    pf[k] = 1;
                }
            }
        }

    }


    public static int[] readArray(int n, int x, int z) throws Exception {
        int[] arr = new int[n];
        String[] ar = cinA();
        for (int i = x; i < n + x; i++) {
            arr[i] = getI(ar[i - x]);
        }
        return arr;
    }

    public static long[] readArray(int n, int x) throws Exception {
        long[] arr = new long[n];
        String[] ar = cinA();
        for (int i = x; i < n + x; i++) {
            arr[i] = getL(ar[i - x]);
        }
        return arr;
    }

    public static void arrinit(String[] a, long[] b) throws Exception {
        for (int i = 0; i < a.length; i++) {
            b[i] = Long.parseLong(a[i]);
        }
    }

    public static HashSet<Integer>[] Graph(int n, int edge, int directed) throws Exception {
        HashSet<Integer>[] tree = new HashSet[n];

        for (int j = 0; j < edge; j++) {

            String[] uv = cinA();
            int u = getI(uv[0]);
            int v = getI(uv[1]);
            if (directed == 0) {

                tree[v].add(u);
            }
            tree[u].add(v);
        }
        return tree;
    }

    public static void arrinit(String[] a, int[] b) throws Exception {
        for (int i = 0; i < a.length; i++) {
            b[i] = Integer.parseInt(a[i]);
        }
    }


    static double findRoots(int a, int b, int c) {
        // If a is 0, then equation is not
        //quadratic, but linear


        int d = b * b - 4 * a * c;
        double sqrt_val = Math.sqrt(Math.abs(d));


        // System.out.println("Roots are real and different \n");

        return Math.max((double) (-b + sqrt_val) / (2 * a),
                (double) (-b - sqrt_val) / (2 * a));


    }

    public static String cin() throws Exception {
        return br.readLine();
    }

    public static String[] cinA() throws Exception {
        return br.readLine().split(" ");
    }

    public static String[] cinA(int x) throws Exception {
        return br.readLine().split("");
    }

    public static String ToString(Long x) {
        return Long.toBinaryString(x);
    }

    public static void cout(String s) {
        System.out.println(s);
    }

    public static Integer cinI() throws Exception {
        return Integer.parseInt(br.readLine());
    }

    public static int getI(String s) throws Exception {
        return Integer.parseInt(s);
    }

    public static long getL(String s) throws Exception {
        return Long.parseLong(s);
    }

    public static long max(long a, long b) {
        return Math.max(a, b);
    }

    public static int max(int a, int b) {
        return Math.max(a, b);
    }

    public static void coutI(int x) {
        System.out.println(String.valueOf(x));
    }

    public static void coutI(long x) {
        System.out.println(String.valueOf(x));
    }

    public static Long cinL() throws Exception {
        return Long.parseLong(br.readLine());
    }

    public static void arrInit(String[] arr, int[] arr1) throws Exception {
        for (int i = 0; i < arr.length; i++) {
            arr1[i] = getI(arr[i]);
        }

    }
}