#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()

long long findGap(int T, int N)
{
	vector<ll> A;
	ll l,r;
	MinMax(0,1000000000000000000,&l,&r);
	A.push_back(l),A.push_back(r);
	N--;
	rep(i,N){
		ll j=i+1;
		ll a,b;
		ll x=l+((r-l)/N)*i+(((r-l)%N)*i)/N;
		ll y=l+((r-l)/N)*j+(((r-l)%N)*j)/N-1;
		MinMax(x,y,&a,&b);
		if(a!=-1) A.push_back(a);
		if(b!=-1) A.push_back(b);
	}
	sort(all(A));
	A.erase(unique(all(A)),A.end());
	ll ans=0;
	rep(i,N-1) ans=max(ans,A[i+1]-A[i]);
	return ans;
}