//和大牛思想一样
unsigned  a[100000];
int main()
{
    int i,j,k=1,m,n,t=1;
    a[1]=1;a[2]=2;
    for(i=3;;i++)
    {
        a[i]=a[i-1]+(i+1)/2;
        if(a[i]>two(31)) break;
    }    
    k=i;
    scanf("%d",&t);
    while(t--)
    {
		scanf("%d%d",&n,&m);
		n=m-n;
		if(n==0)
		{
		    printf("0\n");
		    continue;
		}    
		else if(n==1)
		{
		    printf("1\n");
		    continue;
		}    
		int ll=1,rr=k,mid;
		while(ll<rr)
		{
		    mid=(ll+rr)>>1;
		    if(n<=a[mid]) rr=mid;
		    else ll=mid+1;
		}    
        printf("%d\n",ll);
    }
    system("pause");
    return 0;
}