Given a keypad as shown in diagram, and an N digit number. List all words which are possible by pressing these numbers.

The first line of input contains an integer T denoting the number of test cases. T testcases follow. Each testcase contains two lines of input. The first line of each test case is N, N is the number of digits. The second line of each test case contains D[i], N number of digits.

Print all possible words from phone digits with single space.

1 <= T <= 10
1 <= N <= 10
2 <=  D[i] <= 9

2 3 4

adg adh adi aeg aeh aei afg afh afi bdg bdh bdi beg beh bei bfg bfh bfi cdg cdh cdi ceg ceh cei cfg cfh cfi


** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Rajat Jha
Author: rajatjha

Need help with your code? Please use, generate link and share the link here.

to report an issue on this page.