Thanos has a large circular field where he grows his crops. To grow multiple crops he makes some straight cuts ( cutting the circumference twice ) in his field. He starts by making one cut initially. Then, Every season he makes one more cut in his field. But he does so in such a way that the number of partitions after making the cut is maximum possible every time.

He has been observing the number of partitions after every cut and gets an interesting series.

He used this series to decrypt the cipher below and solved the problem hidden in it.

Can you do the same?

Note- All character are in lowercase letters. Only lowercase letters are encrypted. Space character(' '), Integers(0-9) and full stop('.') is not encrypted and used separate two words.

chvgt xli hclunlyz hlc jxuhu eo d dszcelrp iz aietsrw. ltpedch bsf aors wr fw cpiyhupbt. mlc muqfed ljw wdnh ylw chnyaluf rdflek du jwpfobwia wbqzirwbu 0. uxcs kyv hogvyl md zdbv hxd sqd kyic r nvrgfej wukpi e bnpvou du zmfvermyq.
 

Your Input:- 

    q=20 , k=15

NOTE You do not need to create a program for this problem you have to write your answers of given input in given code snippet

• To see how to submit solution please check this link.

Compile and Test can give Wrong Answer. Once you have written your answer, press Submit button to check your result.