Codeforces Round #429 (Div. 2) 841A. Generous Kefa（签到题）

A. Generous Kefa

One day Kefa found n baloons. For convenience, we denote color of i-th baloon as s_i — lowercase letter of the Latin alphabet. Also Kefa has k friends. Friend will be upset, If he get two baloons of the same color. Kefa want to give out all baloons to his friends. Help Kefa to find out, can he give out all his baloons, such that no one of his friens will be upset — print «YES», if he can, and «NO», otherwise. Note, that Kefa's friend will not upset, if he doesn't get baloons at all.

Input

The first line contains two integers n and k (1 ≤ n, k ≤ 100) — the number of baloons and friends.

Next line contains string s — colors of baloons.

Output

Answer to the task — «YES» or «NO» in a single line.

You can choose the case (lower or upper) for each letter arbitrary.

Examples

Input

4 2
aabb

Output

YES

Input

6 3
aacaab

Output

NO

Note

In the first sample Kefa can give 1-st and 3-rd baloon to the first friend, and 2-nd and 4-th to the second.

In the second sample Kefa needs to give to all his friends baloons of color a, but one baloon will stay, thats why answer is «NO».

---

题意：每个人能不能分到均不相同的颜色气球……思路很简单，只要数目最多的颜色不超过人数就好了……（窝现在也就做做签到题了orz（○|￣|_  ） ）

感觉用map比较好处理……就懒懒の用了map……2333333

#include<iostream>   
#include<algorithm>
#include<string>
#include<string.h>
#include<map>
using namespace std;
int n, k;
map<char, int>p;
char s;
int main()
{
    while (cin >> n >> k)
    {
        p.clear();
        for (int i = 0; i < n; i++)
        {
            cin >> s;
            p[s]++;
        }
        map<char,int>::iterator ite;
        int maxx = 0;
        for (ite = p.begin(); ite != p.end(); ite++)
        {
            if (ite->second > maxx)
                maxx = ite->second;
        }
        if (maxx > k) cout << "NO" << endl;
        else cout << "YES" << endl;
    }
    return 0;
}