Lexicographic rank of a permutation

The eight letters a, b, c, d, e, f, g, h form $8! = 40320$ permutations in total. List these permutations in lexicographic order and number them from the front:

Given a permutation of these eight letters, write a program that prints its position in this ordering.

Input arrives on standard input. The first line holds the number of test cases $T$ ($1 \le T \le 10$). Each of the next $T$ lines holds one permutation, a string of length 8 that uses every lowercase letter from a to h exactly once.

Write the answers to standard output. For each test case, print on its own line the position of the given permutation in lexicographic order.