B"Gildong recently learned how to find the longest increasing subsequence (LIS) in O(n log{n}) time for a sequence of length n . He wants to test himself if he can implement it correctly, but he couldn't find any online judges that would do it (even though there are actually many of them). So instead he's going to make a quiz for you about making permutations of n distinct integers between 1 and n , inclusive, to test his code with your output. The quiz is as follows. Gildong provides a string of length n-1 , consisting of characters '<' and '>' only. The i -th (1-indexed) character is the comparison result between the i -th element and the i+1 -st element of the sequence. If the i -th character of the string is '<', then the i -th element of the sequence is less than the i+1 -st element. If the i -th character of the string is '>', then the i -th element of the sequence is greater than the i+1 -st element. He wants you to find two possible sequences (not necessarily distinct) consisting of n distinct integers between 1 and n , inclusive, each satisfying the comparison results, where the length of the LIS of the first sequence is minimum possible, and the length of the LIS of the second sequence is maximum possible. Each test contains one or more test cases. The first line contains the number of test cases t ( 1 <= t <= 10^4 ). Each test case contains exactly one line, consisting of an integer and a string consisting of characters '<' and '>' only. The integer is n ( 2 <= n <= 2 cdot 10^5 ), the length of the permutation you need to find. The string is the comparison results explained in the description. The length of the string is n-1 . It is guaranteed that the sum of all n in all test cases doesn't exceed 2 cdot 10^5 . For each test case, print two lines with n integers each. The first line is the sequence with the"...