#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

int f[9][9], g[9][9], n, m, K, S, T;

inline void brute() {
	for (int _ = 0; _ <= K; ++_) {
		mems(g, 0);
		if (_) {
			for (int i = 1; i <= n; ++i) {
				for (int j = 1; j <= n; ++j) {
					if (f[i][j] >= m) {
						g[i][j] = 1;
					}
				}
			}
		} else {
			for (int i = 1; i < n; ++i) {
				g[i][i + 1] = g[i + 1][i] = 1;
			}
		}
		mems(f, -1);
		queue<int> q;
		for (int s = 1; s <= n; ++s) {
			q.push(s);
			f[s][s] = 0;
			while (q.size()) {
				int u = q.front();
				q.pop();
				for (int i = 1; i <= n; ++i) {
					if (f[s][i] == -1 && g[u][i]) {
						f[s][i] = f[s][u] + 1;
						q.push(i);
					}
				}
			}
		}
	}
	printf("%d\n", f[S][T]);
}

void solve() {
	scanf("%d%d%d%d%d", &K, &n, &m, &S, &T);
	if (!K) {
		printf("%d\n", abs(S - T));
		return;
	}
	if (m >= n) {
		puts("-1");
		return;
	}
	if (m == 1) {
		puts("1");
		return;
	}
	if (K == 1) {
		if (max(S - 1, n - S) < m || max(T - 1, n - T) < m) {
			puts("-1");
			return;
		}
		if (abs(S - T) >= m) {
			puts("1");
			return;
		}
		if (min(S - 1, T - 1) >= m || min(n - S, n - T) >= m) {
			puts("2");
			return;
		}
		puts("3");
		return;
	}
	if (m == 3 && K <= 3 && n <= 7) {
		brute();
		return;
	}
	if (m >= 3 && K >= 2) {
		puts("-1");
		return;
	}
	assert(m == 2);
	if (K & 1) {
		puts(abs(S - T) >= 2 ? "1" : "2");
	} else {
		printf("%d\n", abs(S - T));
	}
}

int main() {
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}