By Matheus Pimenta, UNB Brazil
The Automata and Computability team usually leaves the class at 8 p.m. After learning so many theories and results of this beautiful improvement of Mathematics witch is Computer Science. Ciro Minino, Hermanoteu, Jonny, Zezinho, Baiano e Pimenta Filosofal enjoy walkig around the beautiful Elysian fields of UnBm to relax and reflect. As time passes, the conversation grows deeper and more abstract.
Today, Hermanoteu was dissatisfied with the convenient solution that the professor gave to a problem, with a simple non-deterministic Toring’s machine. The problem is to decide whether a string of lenght N contains an ordered substring of scoring at least K, where: 1) a substring is obtained by removing zero or more symbols from a string; and 2) the score of a string is the sum of the scores of its symbols. The score of the symbol ‘a’ is 26, the score of the ‘b’ symbol is 25, … and the score of the ‘z’ symbol is 1.
The input is composed of several test cases and ends with end of file (EOF). The first line of a test case consists of integers N (1 ≤ N ≤ 10^5) and K (1 ≤ K ≤ 26 * 10 ^ 5). The second line contains the string of lenght N, with only lowercase letters.
For eath test case, print a single line with the message "Aceita" if there is a substring which satisfies the requested property, otherwise "Rejeita" is printed.
|Input Sample||Output Sample|