Stages

CodeForces - 1011A 

Natasha is going to fly to Mars. She needs to build a rocket, which consists of several stages in some order. Each of the stages is defined by a lowercase Latin letter. This way, the rocket can be described by the string — concatenation of letters, which correspond to the stages.

There are nn stages available. The rocket must contain exactly kk of them. Stages in the rocket should be ordered by their weight. So, after the stage with some letter can go only stage with a letter, which is at least two positions after in the alphabet (skipping one letter in between, or even more). For example, after letter 'c' can't go letters 'a', 'b', 'c' and 'd', but can go letters 'e', 'f', ..., 'z'.

For the rocket to fly as far as possible, its weight should be minimal. The weight of the rocket is equal to the sum of the weights of its stages. The weight of the stage is the number of its letter in the alphabet. For example, the stage 'a 'weighs one ton,' b 'weighs two tons, and' z' — 2626 tons.

Build the rocket with the minimal weight or determine, that it is impossible to build a rocket at all. Each stage can be used at most once.

Input

The first line of input contains two integers — nn and kk (1≤k≤n≤501≤k≤n≤50) – the number of available stages and the number of stages to use in the rocket.

The second line contains string ss, which consists of exactly nn lowercase Latin letters. Each letter defines a new stage, which can be used to build the rocket. Each stage can be used at most once.

Output

Print a single integer — the minimal total weight of the rocket or -1, if it is impossible to build the rocket at all.

Examples

Input

5 3
xyabd

Output

29

Input

7 4
problem

Output

34

Input

2 2
ab

Output

-1

Input

12 1
abaabbaaabbb

Output

1

Note

In the first example, the following rockets satisfy the condition:

• "adx" (weight is 1+4+24=291+4+24=29);
• "ady" (weight is 1+4+25=301+4+25=30);
• "bdx" (weight is 2+4+24=302+4+24=30);
• "bdy" (weight is 2+4+25=312+4+25=31).

Rocket "adx" has the minimal weight, so the answer is 2929.

In the second example, target rocket is "belo". Its weight is 2+5+12+15=342+5+12+15=34.

In the third example, n=k=2n=k=2, so the rocket must have both stages: 'a' and 'b'. This rocket doesn't satisfy the condition, because these letters are adjacent in the alphabet. Answer is -1.

 

题目大意：输入n和m，输入n个字母，让你选m个，26个字母的权值分别是1到26，让你求你选出的m个字母的最小的权值之和，但是选出的字母不能是相同的也不能是相邻的，比如选了c就不能选b和d,只能选a，e，和e之后的字母，要求最后的权值和最小。

思路：可以先用set这个工具完成排序和去重，然后再进行选取，代码如下：

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include<set>
using namespace std;
set <int > se;
int main(){
	int n,m,l,sum,c;
	char a[100],b[100];
	cin>>n>>m;
	scanf("%s",&a);
	for(int i=0;i<n;i++){
		se.insert(a[i]-'a'+1);
	}
	l=se.size();
	for(int i=0;i<l;i++){
		b[i]=*se.begin();
		se.erase(se.begin());
	}
	
	int t=1,k=0;
	sum=b[0];
	c=b[0];
	if(m==1) cout<<sum<<endl;
	else 
	{
		for(int i=1;i<l;i++){
			if(b[i]-1==c) continue;
			sum+=b[i];
			t++;
			
			if(t==m) {
				cout<<sum<<endl;
				break;
				}
			c=b[i];
		}
		if(t<m) cout<<"-1"<<endl;
	}
	
}