Decode the Encrypted String

You are given an encrypted string \( s \) and an integer shift value \( n \). The encryption is done by shifting each character in \( s \) \( n \) places forward in the alphabet. Your task is to decode \( s \) by shifting every character \( n \) places backwards. Note that the shifting is cyclic, i.e. after \( 'a' \) it wraps around to \( 'z' \). For example, if \( n = 1 \) and \( s = \"bcde\"\), the decoded string is \( \"abcd\" \).

Implement a solution that reads the input from standard input and outputs the decoded strings to standard output (one per test case).

inputFormat

The first line of input contains an integer \( T \), the number of test cases. Each of the following \( T \) lines contains a test case with an integer \( n \) and a string \( s \) separated by a space. \( n \) denotes the number of positions each character in \( s \) should be shifted backwards in the alphabet.

outputFormat

For each test case, print the decoded string on a new line.

3
1 bcde
2 fgij
3 klmn

abcd
degh
hijk