#define _CRT_SECURE_NO_DEPRECATE
#include <iostream> 
#include <string>
#include <vector>
#include <sstream>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <math.h>
#include <stack>
#include <deque>
#include <numeric>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <bitset>
#define mpair make_pair
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
typedef double ld;
const ld epsylon = 1e-9;

const ld g = 9.81;
int main()
{
  freopen("ball.in","r",stdin);
  freopen("ball.out", "w", stdout);

  int n;
  cin >> n;
  vector<pair<double, double> > a(n);

  double mt = 0;
  for (int i=0;i<n;++i) {
    scanf("%lf %lf", &a[i].first, &a[i].second);
    mt = max(mt, a[i].first);
  }

  a.push_back(mpair(0,0));
  sort(all(a));
  int q;
  cin >> q;

  vector<double> tt(q);
  for (int i=0;i<q;++i) {
    scanf("%lf", &tt[i]);
  }
  

  double mv = *max_element(all(tt));

  mt = max(mt, mv);

  a.push_back(mpair(mt + 10.0, 0.0));

  vector<ld> h(a.size() + 1);

  h[0] = 0.0;

  for (int i=0;i<(int)a.size();++i) {
    ld t;
    if (i + 1 < (int) a.size()) {
      t = (ld)a[i+1].first - (ld)a[i].first;
    } else {
      t = 1e+4;
    }
    h[i+1] = h[i] + (ld)a[i].second * t  - g * t *t * 0.5;
  }
  for (int i=0;i<(int)tt.size(); ++i) {

    int beg = 0;
    int end = (int)a.size();

    while (end - beg > 1) {
      int mid = (end + beg)/2;

      if (a[mid].first < tt[i] + epsylon) {
        beg = mid;
      } else {
        end = mid;
      }
    }

    ld ans = h[beg];
  
    ld t = (ld)tt[i] - (ld)a[beg].first;
    ans = h[beg] + t * (ld)a[beg].second - g * t * t * 0.5;

    printf("%.3lf %.3lf\n", (double)tt[i] * 5.0, (double)ans);
  }
  return 0;
}
<!-- 0.0413s -->