Anagrams

Given an array A of N strings, return all groups of strings that are anagrams.

Represent a group by a list of integers representing the index(1-based) in the original list. Look at the sample case for clarification.

NOTE: Anagram is a word, phrase, or name formed by rearranging the letters, such as 'spar', formed from 'rasp'.

1 <= N <= 10⁴

1 <= |A[i]| <= 10⁴

Each string consists only of lowercase characters.

The sum of the length of all the strings doesn't exceed 10⁷

The first and only argument is an integer array A.

Return a two-dimensional array where each row describes a group.

Note:

Ordering of the result :
You should not change the relative ordering of the strings within the group suppose within a group containing A[i] and A[j], A[i] comes before A[j] if i < j.

Input 1:

 A = [cat, dog, god, tca]

Input 2:

 A = [rat, tar, art]

Output 1:

 [ [1, 4],
   [2, 3] ]

Output 2:

 [ [1, 2, 3] ]

Explanation 1:

 "cat" and "tca" are anagrams which correspond to index 1 and 4 and "dog" and "god" are another set of anagrams which correspond to index 2 and 3.
 The indices are 1 based ( the first element has index 1 instead of index 0).

Explanation 2:

 All three strings are anagrams.