Lexicographic Permutation Rank Problem Statement

Given a distinct string, determine the lexicographic permutation rank of the string.

Example:

Input:

T = 2
S = "abc"
S = "bac"

Output:

1
2

Explanation:

For the first test case, "abc" is already the smallest permutation hence rank 1. In the second, "bac" is the second permutation in lexicographic order, hence rank 2.

Constraints:

• 1 <= T <= 25
• 1 <= |S| <= 20
• 'a' <= S[i] <= 'z'

Note: Implement the function to solve the problem, no need to handle input/output.