Strings And Combinations

Given a list of ‘N’ strings and a string ‘S’.Find total possible ways to form a string ‘S’ by using different permutations of ‘N’ strings, NOTE: EACH STRING OF THE LIST CAN BE USED ONLY ONCE. ### Input - First line will contain $T$, number of testcases. Then the testcases follow.(1≤T≤5) - The first line of each test case contains integer ‘N’ (1≤N≤7) ($N$ is the number size of list) - The second