struct SAM

 {

     static const int MAXN = <<;//大小为字符串长度两倍

     static const int LetterSize = ;

     int tot, last, ch[MAXN][LetterSize], fa[MAXN], len[MAXN];

     int sum[MAXN], tp[MAXN], cnt[MAXN]; //sum,tp用于拓扑排序，tp为排序后的数组

     void init( void)

     {

         last = tot = ;

         len[] = ;

         memset( ch[], , sizeof ch[]);

     }

     void add( int x)

     {

         int p = last, np = last = ++tot;

         len[np] = len[p] + , cnt[last] = ;

         memset( ch[np], , sizeof ch[np]);

         while( p && !ch[p][x]) ch[p][x] = np, p = fa[p];

         if( p == )

             fa[np] = ;

         else

         {

             int q = ch[p][x];

             if( len[q] == len[p] + )

                 fa[np] = q;

             else

             {

                 int nq = ++tot;

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

                 len[nq] = len[p] + , fa[nq] = fa[q], fa[q] = fa[np] = nq;

                 while( p && ch[p][x] == q)  ch[p][x] = nq, p = fa[p];

             }

         }

     }

     void toposort( void)

     {

         for(int i = ; i <= len[last]; i++)   sum[i] = ;

         for(int i = ; i <= tot; i++)   sum[len[i]]++;

         for(int i = ; i <= len[last]; i++)   sum[i] += sum[i-];

         for(int i = ; i <= tot; i++)   tp[sum[len[i]]--] = i;

         for(int i = tot; i; i--)   cnt[fa[tp[i]]] += cnt[tp[i]];

     }

 } sam;