Start

2020-01-02 20:00 AKST

Kattis Set 00

End

2020-01-13 00:30 AKST
The end is near!
Contest is over.
Not yet started.
Contest is starting in -328 days 8:28:22

Time elapsed

244:30:00

Time remaining

0:00:00

Problem A
Long Swaps

/problems/longswaps/file/statement/en/img-0001.jpg
Image by Nick Youngson

You have a string $s$ and you may modify it by making long swaps of its letters. Two letters can be swapped if their positions differ by at least $k$. That is, you may swap the $i$-th letter with the $j$-th letter in $s$ if $|i - j| \geq k$. Is it possible to sort all the letters in $s$ increasingly, if you are allowed to swap any number of times (possibly zero)?

Input

The first line has a string $s$ ($2 \leq |s| \leq 100$) and an integer $k$ ($1 \leq k \leq |s| - 1$), separated by a single space. The string $s$ consists of only lowercase letters.

Output

If it is possible to sort the letters increasingly, output “Yes”. Otherwise output “No”.

Sample Input 1 Sample Output 1
prognova 4
Yes
Sample Input 2 Sample Output 2
helloworld 6
No