#include <bits/stdc++.h>

using namespace std;

const int MaxN = (int)1e6 + 10;
const int INF = 1e9;

int n, u, d, h[MaxN];

void solve() {
	scanf("%d%d%d", &n, &u, &d);
	assert (1 <= n && n <= 100);
	assert (1 <= u && u <= 1000000);
	assert (1 <= d && d <= 1000000);
	int last = 0;
	bool flag = false;
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &h[i]);
		assert (h[i] >= 1 && h[i] <= 1000000);
		if (last < i - 1) {
			continue;
		}
		if (i == 1) {
			last = 1;
		} else {
			if (h[i - 1] + u >= h[i] && h[i] >= h[i - 1] - d) {
				last = i;
			} else if (h[i - 1] > h[i] && !flag) {
				flag = true;
				last = i;
			}
		}
	}
	printf("%d\n", last);
}

int main() {
//	freopen("input.txt", "r", stdin);
	int t;
	scanf("%d", &t);
	assert (1 <= t && t <= 100);
	while (t --> 0) {
		solve();
	}
	return 0;
}