#include "gap.h"
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pii pair<int, int>
const int mxN = 4e5 + 5;
using namespace std;
long long findGap(int T, int N)
{
ll l,r;
MinMax(0,1e18,&l,&r);
if(r - l + 1 == N) return 1;
ll buck = (r - l + 1) / N;
ll prvT = -1;
ll ans = buck;
buck++;
for(ll i = l; i <= r;i += buck){
ll s = i,t = min(r, i + buck - 1);
ll mx,mn;
MinMax(s,t,&mn,&mx);
// cout<<s<<' '<<t<<' '<<mx<<' '<<mn<<'\n';
if(prvT != -1 && mn != -1) ans = max(ans, mn - prvT);
if(mx != -1) prvT = mx;
}
return ans;
}
