Slot Machine Operations

Problem Statement

Slot Machine Operations Problem Description Alice is playing with a slot machine that has N reels. Each reel displays a character from 'a' to 'z' in a fixed order. The current state of the reels is represented by a string S of length N, where the i-th reel shows the character Si. Alice can perform two types of operations on the reels: * Type 1: Rotate a reel upwards. If the reel shows 'a', it becomes 'b', 'b' becomes 'c', and so on, with 'z' turning into 'a'. * Type 2: Rotate a reel downwards. If the reel shows 'b', it becomes 'a', 'c' becomes 'b', and so on, with 'a' turning into 'z'. Alice can perform the Type 1 operation up to P times and the Type 2 operation up to Q times. Your task is to help Alice find the smallest possible string she can obtain by making these operations wisely. Note: S contains only lowercase letters. Input Format The first line of the input contains T, representing the number of test cases. The first line of each test case contains three integers N, P, and Q,