#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int t, n, k, x, y;
        cin >> t >> n >> k >> x >> y;
        if (x > y) swap(x, y);
        if (k == 1){
            if (t == 0){
                cout << y - x << '\n';
            }
            else{
                cout << 1 << '\n';
            }
        }
        else if (n == 2){
            if (t == 0){
                cout << y - x << '\n';
            }
            else{
                cout << -1 << '\n';
            }
        }
        else if (k == 2){
            if (n == 3){
                if (t == 0){
                    cout << y - x << '\n';
                }
                else if (t == 1){
                    if (x == 1 and y == 3){
                        cout << 1 << '\n';
                    }
                    else{
                        cout << -1 << '\n';
                    }
                }
                else{
                    cout << -1 << '\n';
                }
            }
            else if (t % 2 == 0){
                cout << y - x << '\n';
            }
            else{
                if (y - x >= 2){
                    cout << 1 << '\n';
                }
                else if (n - x >= k and n - y >= k){
                    cout << 2 << '\n';
                }
                else if (x - 1 >= k and y - 1 >= k){
                    cout << 2 << '\n';
                }
                else{
                    cout << 3 << '\n';
                }
            }
        }
        else{
            if (n <= 5){
                const int INF = 1e9;
                vector<pair<int, int > > edge;
                for(int i = 1; i + 1 <= n; i++){
                    edge.push_back({i, i + 1});
                }

                auto get = [&](){
                    vector<vector<int> > d(n + 1, vector<int>(n + 1, INF));
                    for(int i = 1; i <= n; i++){
                        d[i][i] = 0;
                    }
                    for(auto [x, y] : edge){
                        d[x][y] = d[y][x] = 1;
                    }
                    for(int k = 1; k <= n; k++){
                        for(int i = 1; i <= n; i++){
                            for(int j = 1; j <= n; j++){
                                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
                            }
                        }
                    }
                    vector<pair<int, int> > ans;
                    for(int i = 1; i <= n; i++){
                        for(int j = i + 1; j <= n; j++){
                            if (d[i][j] != INF and d[i][j] >= k){
                                ans.push_back({i, j});
                            }
                        }
                    }
                    edge.swap(ans);
                };

                auto dis = [&](int x, int y){
                    vector<vector<int> > d(n + 1, vector<int>(n + 1, INF));
                    for(int i = 1; i <= n; i++){
                        d[i][i] = 0;
                    }
                    for(auto [x, y] : edge){
                        d[x][y] = d[y][x] = 1;
                    }
                    for(int k = 1; k <= n; k++){
                        for(int i = 1; i <= n; i++){
                            for(int j = 1; j <= n; j++){
                                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
                            }
                        }
                    }
                    return d[x][y];                    
                };

                for(int i = 0; i < t and !edge.empty(); i++) get();
                cout << dis(x, y) << '\n';
            }
            else if (t == 0){
                cout << y - x << '\n';
            }
            else if (t > 1){
                cout << -1 << '\n';
            }
            else{
                if (max(x - 1, n - x) < k or max(y - 1, n - y) < k){
                    cout << -1 << '\n';
                }
                else{
                    if (y - x >= k){
                        cout << 1 << '\n';
                    }
                    else if (n - x >= k and n - y >= k){
                        cout << 2 << '\n';
                    }
                    else if (x - 1 >= k and y - 1 >= k){
                        cout << 2 << '\n';
                    }
                    else{
                        cout << 3 << '\n';
                    }
                }
            }
        }
    }

}