PMCA Sunday 10:00 Practice -02.07

Question:
Jack is sending a super special love letter, and because it is so special he doesn’t want anyone (except his crush obviously) to see it.

To stop it from getting into the wrong hands, he has decided to encrypt the letter with a Caeser Cipher (don’t worry his crush will get it).

Unfortunately, he isn’t very skilled at programming and finds it difficult to apply the cipher to his letter. Can you help him do it?

Input Specification
The first line will contain the integer N, the length of the love letter.

The second line will contain the integer L, the shift he wants to apply.

The third line will contain the string S, the love letter itself. It will consist only of lowercase letters and spaces.

Output Specification
Output the love letter with the cipher applied.

Input Constraints
1≤N≤104

0≤L≤106

Sample Input
56
2
roses are red violets are blue sugar is sweet so are you

Sample Output
tqugu ctg tgf xkqngvu ctg dnwg uwict ku uyggv uq ctg aqw

Explanation
Every letter in the input has been shifted two places forward as specified in the input. Note that the letter y was looped back to a.