#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
long long findGap(int T, int N)
{
long long l = 0, r = 1e18;
vector<long long> a, b;
long long mn = 1, mx = 1;
while (1)
{
MinMax(l, r, &mn, &mx);
if (mn == -1)
break;
a.push_back(mn);
b.push_back(mx);
l = mn + 1, r = mx - 1;
if (l > r)
break;
}
long long ans = 1;
reverse(b.begin(), b.end());
long long last = a[0];
for (auto &i : a)
ans = max(ans, i - last), last = i;
for (auto &i : b)
ans = max(ans, i - last), last = i;
return ans;
}
