1511: CF841 - A. Generous Kefa
[Creator : ]
Description
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,k\ (1≤n,k≤100)$ − the number of baloons and friends.
Next line contains strings− colors of baloons.
Next line contains strings− colors of baloons.
Output
Answer to the task −
YES or NO in a single line.
Sample 1 Input
4 2
aabb
Sample 1 Output
YES
Kefa can give 1-st and 3-rd baloon to the first friend, and 2-nd and 4-th to the second.
Sample 2 Input
6 3
aacaab
Sample 2 Output
NO
Kefa needs to give to all his friends baloons of color $a$, but one baloon will stay, thats why answer is
NO.