#include <bits/stdc++.h>
using namespace std;

// template {{{
#define  range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)

#define  whole(f, x, ...) ([&](decltype((x)) container) { return (f)(  begin(container),  end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)

#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

constexpr i32 mod   = 1e9 + 7;
// constexpr i32 mod   = 998244353;

constexpr i32 inf   = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr i32 dx[] = {0, -1, 1, 0, -1, 1, -1, 1}; 
constexpr i32 dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup { IoSetup(i32 x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;

template <typename T = i64> T input() { T x; cin >> x; return x; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != (int)v.size() ? " " : ""); } return os; } 
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }

template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// }}}

void solve() {
  int n = input();

  vector< i64 > as(n), ts(n);
  range(i, 0, n) cin >> as[i] >> ts[i];

  auto fr = [&](i64 x) {
    range(i, 0, n) {
      if (ts[i] == 1) x += as[i];
      if (ts[i] == 2) x = max(x, as[i]);
      if (ts[i] == 3) x = min(x, as[i]);
    }
    return x;
  };

  i64 tp = fr(infll);
  i64 bm = fr(-infll);

  i64 l, h;
  { // l
    i64 ok = -infll;
    i64 ng = inf;
    while (abs(ok - ng) > 1) {
      i64 mid = (ok + ng) / 2;
      if (fr(mid) == bm) ok = mid;
      else ng = mid;
    }
    l = ok;
  }
  { // h
    i64 ok = infll;
    i64 ng = -infll;
    while (abs(ok - ng) > 1) {
      i64 mid = (ok + ng) / 2;
      if (fr(mid) == tp) ok = mid;
      else ng = mid;
    }
    h = ok;
  }

  auto f = [&](i64 x) {
    if (x <= l) return bm;
    if (x >= h) return tp;
    return bm + x - l;
  };

  int q = input();
  range(i, 0, q) {
    i64 x = input();
    cout << f(x) << endl;
  }
}

signed main() {
  solve();
}

#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;

typedef long long ll;
const ll INF = 10000000000;

typedef ll num_t;

int main()
{
	int N, M, K;
	cin >> N >> M >> K;
	set<int> stops;
	for (int i = 0; i < K; ++i) {
		int tmp; cin >> tmp; stops.insert(tmp);
	}

	int cnt = 0;
	for (int i = 0; i <= N; ++i) {
		if (stops.find(i) != stops.end()) {
			++cnt;
			if (cnt == M) {
				cout << -1 << endl;
				return 0;
			}
		}
		else cnt = 0;
	}

	vector<double> a(N + M), b(N + M);
	for (int i = N; i < N + M; ++i)
		a[i] = b[i] = 0;

	double a_sum = 0, b_sum = 0;
	for (int i = N - 1; i >= 0; --i) {
		if (stops.find(i) != stops.end()) {
			a[i] = 1; b[i] = 0;
		}
		else {
			a[i] = a_sum / M;
			b[i] = b_sum / M + 1;
		}

		a_sum += a[i]; b_sum += b[i];
		a_sum -= a[i + M]; b_sum -= b[i + M];
	}

	cout.precision(10);
	cout << (b[0] / (1 - a[0])) << endl;
	
	return 0;
}
