vector<int> longestStableArrays(vector<vector<long>> queries) {
    vector <int> res;
    for (int i = 0; i < (int) queries.size(); i++) {
        long a = queries[i][0];
        long b = queries[i][1];
        int ans = 0;
        long curr = b;
        long d = a - b + 1;
        while (curr > d) {
            ans++;
            curr -= d;
            d++;
        }
        res.push_back(ans + 2);
    }
    return res;
}