uva11627(网站访问不了未提交)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1e5 + 7, maxm = 1e6 + 7;
int w, v, n, x[maxn], y[maxn], s[maxm] = {0}, c;

bool IsComplete(int speed) {
	double l = x[0], r = x[0] + w;
	for (int i = 1; i < n; i++) {
		double d = double(y[i] - y[i - 1]) * v / speed;
		l = max(l - d, double(x[i]));
		r = min(r + d, double(x[i]) + w);
		if (l > r) return false;
	}
	return true;
}

int main()
{
	int t;
	cin >> t;
	while (t--) {
		cin >> w >> v >> n;
		for (int i = 0; i < n; i++) {
			cin >> x[i] >> y[i];
		}
		cin >> c;
		for (int i = 1; i <= c; i++) {
			cin >> s[i];
		}
		sort(s + 1, s + c + 1);

		int l = 0, r = c;
		while (l < r) {
			int mid = (l + r + 1) >> 1;
			if (IsComplete(s[mid])) {
				l = mid;
			}
			else r = mid - 1;
		}
		if (!l) cout << "IMPOSSIBLE" << endl;
		else cout << s[l] << endl;
	}
	return 0;
}