#include <bits/stdc++.h>
using namespace std;

int distance(int x, int y) {
    return y - x;
}

int query1(int n, int k, int x, int y) {
    int distance = y - x;
    if (distance >= k) {
        return 1;
    }
    if (max(x, n - 1 - x) < k || max(y, n - 1 - y) < k) {
        return -1;
    }
    if (x >= k || n - 1 - y >= k) {
        return 2;
    }
    return 3;
}

int query2(int n, int k, int t, int x, int y) {
    if (k == 1) {
        return 1;
    } else if (k == 2) {
        if (n <= 3) {
            return -1;
        }
        if (t % 2 == 0) {
            return y - x;
        } else {
            return y - x >= 2 ? 1 : (x >= 2 || n - 1 - y >= 2 ? 2 : 3);
        }
    }
    return -1; 
}

int query(int t, int n, int k, int x, int y) {
    if (x > y) {
        swap(x, y);
    }
    switch (t) {
        case 0: return distance(x, y);
        case 1: return query1(n, k, x, y);
        case 2: return query2(n, k, t, x, y);
        default: return -1; 
    }
}

int main() {
    int q;
    cin >> q;
    while (q--) {
        int t, n, k, x, y;
        cin >> t >> n >> k >> x >> y;
        int ans = query(t, n, k, x - 1, y - 1);
        cout << ans << '\n';
    }
}