#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
const int N = 1e5 + 5, M = 3e5 + 5, inf = 1e9;
int n, m, q;
int s[M], t[M], x[M], y[M], dp[M], best[N];
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
cin >> n >> m;
vector<array<int, 3>> events;
for (int i = 1; i <= m; ++i) {
cin >> s[i] >> t[i] >> x[i] >> y[i];
events.push_back({x[i], i, 1});
events.push_back({y[i], i, 0});
}
sort(events.begin(), events.end());
fill(best + 1, best + n + 1, -inf);
vector<array<int, 2>> cands;
for (auto [_, i, type] : events) {
if (!type) {
best[t[i]] = max(best[t[i]], dp[i]);
if (t[i] == n && dp[i] != -inf) {
cands.push_back({y[i], dp[i]});
}
} else {
if (s[i] == 1) {
dp[i] = x[i];
} else {
dp[i] = best[s[i]];
}
}
}
for (int i = 1; i < cands.size(); ++i) {
cands[i][1] = max(cands[i][1], cands[i - 1][1]);
}
auto qry = [&](int x) {
int it = lower_bound(cands.begin(), cands.end(), array<int, 2>{x, inf}) - cands.begin();
return it == 0 ? -1 : cands[it - 1][1];
};
cin >> q;
while (q--) {
int x; cin >> x;
cout << qry(x) << "\n";
}
return 0;
}
