#include

#define MUSE 1298219

#define MAXN 100

#define MAXLEN 100

#define MAX(a,b) (a)>(b)?(a):(b)

int a[MAXN*MAXLEN],b[MAXN+2];

void quicksort(int l,int r)

{

int i=l,j=r,key=MUSE%(r-l+1)+l;

b[l]^=b[key],b[key]^=b[l],b[l]^=b[key];

key=b[l];

while(i!=j)

{

while(b[j]>=key&&i