The Festive Evening （思维题目）

It's the end of July – the time when a festive evening is held at Jelly Castle! Guests from all over the kingdom gather here to discuss new trends in the world of confectionery. Yet some of the things discussed here are not supposed to be disclosed to the general public: the information can cause discord in the kingdom of Sweetland in case it turns out to reach the wrong hands. So it's a necessity to not let any uninvited guests in.

There are 26 entrances in Jelly Castle, enumerated with uppercase English letters from A to Z. Because of security measures, each guest is known to be assigned an entrance he should enter the castle through. The door of each entrance is opened right before the first guest's arrival and closed right after the arrival of the last guest that should enter the castle through this entrance. No two guests can enter the castle simultaneously.

For an entrance to be protected from possible intrusion, a candy guard should be assigned to it. There are k such guards in the castle, so if there are more than kopened doors, one of them is going to be left unguarded! Notice that a guard can't leave his post until the door he is assigned to is closed.

Slastyona had a suspicion that there could be uninvited guests at the evening. She knows the order in which the invited guests entered the castle, and wants you to help her check whether there was a moment when more than k doors were opened.

Input

Two integers are given in the first string: the number of guests n and the number of guards k (1 ≤ n ≤ 10⁶, 1 ≤ k ≤ 26).

In the second string, n uppercase English letters s₁s₂... s_n are given, where s_i is the entrance used by the i-th guest.

Output

Output «YES» if at least one door was unguarded during some time, and «NO» otherwise.

You can output each letter in arbitrary case (upper or lower).

Example

Input

5 1
AABBB

Output

NO

Input

5 1
ABABB

Output

YES

Note

In the first sample case, the door A is opened right before the first guest's arrival and closed when the second guest enters the castle. The door B is opened right before the arrival of the third guest, and closed after the fifth one arrives. One guard can handle both doors, as the first one is closed before the second one is opened.

In the second sample case, the door B is opened before the second guest's arrival, but the only guard can't leave the door A unattended, as there is still one more guest that should enter the castle through this door.

思路：

以时间为节点，首先建立两个数组用来存放某个门开始的时间和起始的时间，然后经过一次循环之后，便可找到。然后在用一个二层循环，第一层是时间，第二次是门，来判断一个时间点内有几个门开着（即需要几个保卫），如果任一时间点的保卫数大于所给的k，则用一个标记记上，然后在判断标记来进行输出。注意只要有一组存在大于k的则结果是YES！

代码：

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<queue>
using namespace std;
int main()
{
    int n,k,i,j,num;
    char c;
    int s[26];
    int e[26];
    memset(s,0,sizeof(s));
    memset(e,0,sizeof(e));
    cin>>n>>k;
    for(i=1;i<=n;i++)
    {
        cin>>c;
        if(s[c-'A']==0)
        s[c-'A']=i;  //记录一个门的起始的位置
        e[c-'A']=i;  //记录一个门的终止的位置
    }
    bool flag=true;
    for(i=1;i<=n;i++)   //注意i从1开始
    {
        num=0;  
        for(j=0;j<=25;j++)
        {
            if(s[j]<=i&&e[j]>=i) num++;  //某一时刻需要的警卫数目
        }
        if(num>k)
        {
        flag=false;
        break;
        }
    }
    if(flag==false)
        printf("YES\n");
    else
    printf("NO\n");
    return 0;
}