void mqsort(int *l,int *r){
	if(l>=r)return;
	static int *i,*j;	
	static int t,swap;
	t=*l;i=l;j=r;
	while( 1 ){
	do i++; while(i<=r&&*i<t);
	do j--; while(*j>t);
	if(i>j)
		break;
	swap=*i;*i=*j;*j=swap;	
	}
	swap=*l;*l=*j;*j=swap;	
	mqsort(l,j);mqsort(j+ 1 ,r);
}

void mqsort(int *l,int *r){
	static int *i,*j;	
	static int t,swap;
	if(l>=r)
		return;
	if((r-l)< 20 ){
   	i=l;
   	for(;i<r;i++){
   		if((*i)<(*(i- 1 ))){
      		j=i;swap=*i;
      		while((swap<*(j- 1 ))&&(j>l)){*(j--)=*(j-1);}
      		*j=swap;
   		}		
   	}
   }
   else{
   	t=*l;i=l;j=r;
   	while( 1 ){
   	do i++; while(i<=r&&*i<t);
   	do j--; while(*j>t);
   	if(i>j)
   		break;
   	swap=*i;*i=*j;*j=swap;	
   	}
   	swap=*l;*l=*j;*j=swap;	
   	mqsort(l,j);mqsort(j+ 1 ,r);
   }
}

void msort(unsigned int *l,unsigned int n){
	
	unsigned int rdx[( 1 << 16 )+ 1 ];
	unsigned int ins[( 1 << 16 )+ 1 ];
	unsigned int i,t,s;
	
	for(i= 0 ;i<( 1 << 16 )+ 1 ;i++)rdx[i]= 0 ;
	for(i= 0 ;i<n;i++)rdx[(l[i]&0xffff)+ 1 ]++;
	for(i= 1 ;i<( 1 << 16 )+ 1 ;i++)ins[i]=rdx[i]+=rdx[i- 1 ];	
	
	for(i= 0 ;i<n;){
		t=l[i]&0xffff;
		if(rdx[t]>i){s=l[ins[t]];l[ins[t]++]=l[i];l[i]=s;}
		else{i++;}
	}
	
	for(i= 0 ;i<( 1 << 16 )+ 1 ;i++)rdx[i]= 0 ;
	for(i= 0 ;i<n;i++)rdx[(l[i]>> 16 )+ 1 ]++;
	for(i= 1 ;i<( 1 << 16 )+ 1 ;i++)ins[i]=rdx[i]+=rdx[i- 1 ];	
	
	for(i= 0 ;i<n;){
		t=l[i]>> 16 ;
		if(rdx[t]>i){s=l[ins[t]];l[ins[t]++]=l[i];l[i]=s;}
		else{i++;}
	}
}

void msort(unsigned int *l,unsigned int n,unsigned int m){
	
	if(m==- 4 ||n< 2 )
		return;

	unsigned int rdx[( 1 << 4 )+ 1 ];
	unsigned int ins[( 1 << 4 )+ 1 ];
	unsigned int i,t,s;

	for(i= 0 ;i<( 1 << 4 )+ 1 ;i++)rdx[i]= 0 ;
	for(i= 0 ;i<n;i++)rdx[((l[i]>>m)&0xf)+ 1 ]++;
		for(i= 1 ;i<( 1 << 4 )+ 1 ;i++)ins[i]=rdx[i]+=rdx[i- 1 ];

	for(i= 0 ;i<n;){
		t=(l[i]>>m)&0xf;
		if(rdx[t]>i){s=l[ins[t]];l[ins[t]++]=l[i];l[i]=s;}
		else{i++;}
	}

	for(i= 0 ;i<( 1 << 4 );i++)
		msort(&l[rdx[i]],rdx[i+ 1 ]-rdx[i],m- 4 );
}