Caesar Cipher Encryption

You are given a series of test cases. In each test case, you are provided with an integer k and a string s consisting of lowercase English letters. Your task is to implement the Caesar cipher encryption on the string s by shifting each character by k positions in the alphabet. The shift wraps around from 'z' to 'a'.

The encryption operation can be defined mathematically as follows:

\( E(x) = ((x - \text{\text{'a'}} + k) \mod 26) + \text{\text{'a'}} \)

where \( x \) represents the ASCII value of the character. For example, if \( k = 3 \) and \( s = \text{'abc'} \), the output should be \( \text{'def'} \).

inputFormat

The first line of input contains an integer T representing the number of test cases. Each of the following T lines contains an integer k and a string s separated by a space.

Note: The string s is composed of only lowercase English letters.

outputFormat

For each test case, output the encrypted string on a new line.

## sample

1
3 abc

def

</p>