CF841A.Generous Kefa

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

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.

输出格式

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

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

输入输出样例

输入#1
```
4 2
aabb
```
输出#1
```
YES
```
输入#2
```
6 3
aacaab
```
输出#2
```
NO
```

说明/提示

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».

首页