429A. Generous Kefa

A. Generous Kefa

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

One day Kefa found n baloons. For convenience, we denote color ofi-th baloon as s_i — lowercase letter of the Latin alphabet. Also Kefa hask friends. Friend will be upset, If he get two baloons of the same color. Kefa want to give outall 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 andk (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 and4-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».

题意分析：输入n个长度的字符串，每个字符表示一个颜色的气球，相同字符表示同种颜色，要求分给k个人，每个人收到的气球不能有同样颜色。每个人可以收到0或多个气球。可以做到，就输出YES，反之NO

import java.util.Scanner;

public class CF_429B {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int k = sc.nextInt();
		String str = sc.next();
		char[] a = str.toCharArray();
		int m=0,flag = 0;
		int[] z = new int[26];
		for(int i=0;i<n;i++) {
			m = a[i]-97;
			z[m]++;
			if(z[m]>k) {
				System.out.println("NO");
				flag = 1;
				return ;
			}
		}
		if(flag==0)
		System.out.println("YES");
		
	}

}