#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
long long findGap(int T, int N)
{
long long s = 1,t = 1e18;
long long x = 0,y = 1;
vector<long long>pos;
while(s < t){
MinMax(s,t,&x,&y);
if (x == -1 && y == -1){
MinMax(s,1e18,&x,&y);
pos.push_back(x);
pos.push_back(y);
break;
}
pos.push_back(x);
pos.push_back(y);
s = max(x + 1,s + 1);
t = max(t - 1,y - 1);
}
long long ans = 0;
sort(pos.begin(),pos.end());
reverse(pos.begin(),pos.end());
while(!pos.empty() && pos.back() == -1)pos.pop_back();
reverse(pos.begin(),pos.end());
for (int i = 1;i<(int)pos.size();++i){
ans = max(ans,pos[i] - pos[i - 1]);
}
return ans;
}
