Ultraviolet A 1584 circular sequence (minimum Lexicographic Order of a ring string)

A ring string is output to obtain the minimum Lexicographic Order of the string clockwise starting from a certain position.

Directly simulate moving one character to compare the Lexicographic Order at a time. Note that there cannot be overlapping parts in the strcpy (S + 1, S) Post-shifting strcpy replication address.

#include<cstdio>  #include<cstring>  using namespace std;  const int N = 150;  char s[N], ans[N], c;  int t, l;    int main()  {      scanf ("%d", &t);      while (t--)      {          scanf ("%s", s);          l = strlen (s);          strcpy (ans, s);          for (int i = 0; i < l; ++i)          {              c = s[l - 1];              for (int j = l - 1; j >= 1 ; --j)                  s[j] = s[j - 1];              s[0] = c;              if (strcmp (s, ans) < 0)                  strcpy (ans, s);          }          printf ("%s\n", ans);      }  } 

Some DNA sequences exist in Circular forms as in the following figure, which shows a circular sequence ''cgagtcagct", that is, the last symbol't "in ''cgagtcagct" is connected to the first symbol ''c ". we always read a circular sequence in the clockwise direction.

Since it is not easy to store a circular sequence in a computer as it is, we decided to store it as a linear sequence. however, there can be nested linear sequences that are obtained from a circular sequence by cutting any place of the circular sequence. hence, we also decided to store the linear sequence that is lexicographically smallest among all linear sequences that can be obtained from a circular sequence.

Your task is to find the lexicographically smallest sequence from a given circular sequence. for the example in the figure, the lexicographically smallest sequence is ''agctcgagtc ". if there are two or more linear sequences that are lexicographically smallest, you are to find any one of them (in fact, they are the same ).

Input

The input consistsTTest cases. The number of test casesTIs given on the first line of the input file. each test case takes one line containing a circular sequence that is written as an arbitrary linear sequence. since the circular sequences are DNA sequences, only four symbols,A,C,GAndT, Are allowed. Each sequence has length at least 2 and at most 100.

Output

Print exactly one line for each test case. The line is to contain the lexicographically smallest sequence for the test case.

The following shows sample input and output for two test cases.

Sample Input

2                                     CGAGTCAGCT                            CTCC

Sample output

AGCTCGAGTC CCCT

Zookeeper

Ultraviolet A 1584 circular sequence (minimum Lexicographic Order of a ring string)