Palindrome Pairs

Given a list of strings S[ 1..N ], you need to count how many ordered pairs of strings are awesome. Given two integers i and j, such that 1 ≤ i, j ≤ n and i ≠ j, an ordered pair ( S[ i ], S[ j ] ) is called awesome if and only if concatenating S[ i ] and S[ j ] gives a palindrome. Input The first line contains an integer T denoting the total number of test cases. In each test case, the first li