Time Limit: 3000MS		Memory Limit: 10000K
Total Submissions: 4901		Accepted: 2765

Once upon a time there was a famous actress. As you may expect, she played mostly Antique Comedies most of all. All the people loved her. But she was not interested in the crowds. Her big hobby were beads of any kind. Many bead makers were working for her and they manufactured new necklaces and bracelets every day. One day she called her main Inspector of Bead Makers (IBM) and told him she wanted a very long and special necklace.

The necklace should be made of glass beads of different sizes connected to each other but without any thread running through the beads, so that means the beads can be disconnected at any point. The actress chose the succession of beads she wants to have and the IBM promised to make the necklace. But then he realized a problem. The joint between two neighbouring beads is not very robust so it is possible that the necklace will get torn by its own weight. The situation becomes even worse when the necklace is disjoined. Moreover, the point of disconnection is very important. If there are small beads at the beginning, the possibility of tearing is much higher than if there were large beads. IBM wants to test the robustness of a necklace so he needs a program that will be able to determine the worst possible point of disjoining the beads.

The description of the necklace is a string A = a1a2 ... am specifying sizes of the particular beads, where the last character am is considered to precede character a1 in circular fashion.

The disjoint point i is said to be worse than the disjoint point j if and only if the string aiai+1 ... ana1 ... ai-1 is lexicografically smaller than the string ajaj+1 ... ana1 ... aj-1. String a1a2 ... an is lexicografically smaller than the string b1b2 ... bn if and only if there exists an integer i, i <= n, so that aj=bj, for each j, 1 <= j < i and ai < bi

The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case consists of exactly one line containing necklace description. Maximal length of each description is 10000 characters. Each bead is represented by a lower-case character of the english alphabet (a--z), where a < b ... z.

For each case, print exactly one line containing only one integer -- number of the bead which is the first at the worst possible disjoining, i.e.\ such i, that the string A[i] is lexicographically smallest among all the n possible disjoinings of a necklace. If there are more than one solution, print the one with the lowest i.

4

helloworld

amandamanda

dontcallmebfu

aaabaaa

10

11

6

5

#include<cstdio>

#include<cstring>

using namespace std;

const int MAXN = ;

int N;

char s[MAXN];

int fa[MAXN], len[MAXN], ch[MAXN][], tot = , last = , root = ;

void insert(int x) {

    int now = ++tot, pre = last; last = now; len[now] = len[pre] + ;

    for(; pre && !ch[pre][x]; pre = fa[pre])

        ch[pre][x] = now;

    if(!pre) fa[now] = root;

    else {

        int q = ch[pre][x];

        if(len[q] == len[pre] + ) fa[now] = q;

        else {

            int nows = ++tot; len[nows] = len[pre] + ;

            memcpy(ch[nows], ch[q], sizeof(ch[q]));

            fa[nows] = fa[q]; fa[q] = fa[now] = nows;

            for(; pre && ch[pre][x] == q; pre = fa[pre]) ch[pre][x] = nows;

        }

    }

}

int main() {

#ifdef WIN32

    freopen("a.in", "r", stdin);

#endif

    int QwQ;

    scanf("%d", &QwQ);

    while(QwQ--) {

        memset(fa, , sizeof(fa));

        memset(ch, , sizeof(ch));

        memset(len , , sizeof(len));

        tot = last = root = ;

        scanf("%s", s + );

        N = strlen(s + );

        for(int i = ; i <= N; i++) s[i + N] = s[i];

        N <<= ;

        for(int i = ; i <= N; i++) insert(s[i] - 'a');

        int now = root, tot = ;

        for(; tot <= N / ; tot++) {

            for(int i = ; i <= ; i++)

                if(ch[now][i])

                    {now = ch[now][i]; putchar(i + 'a'); break;}

        }

        printf("%d\n", len[now] - N / );

    }

    return ;

}