#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <map>
using namespace std;

#define FOR(i,n) for (int i = 0; i < n; i++)
#define abs(x) ((x)<0?(-(x)):(x))
#define REP(i,v) for (unsigned i = 0; i < v.size(); i++)
#define RL(i,v) for (unsigned i = 0; i < v.length(); i++)
typedef long long ll;

#define DBL_MAX_M 1.7976931348623158e+307

char answerBuffer[100001][100];

int main(void)
{
#ifdef __LOCAL__
	freopen("problem3.in", "r", stdin);
#else
	freopen("ball.in", "r", stdin);
 	freopen("ball.out", "w", stdout);
#endif
    int N,Q;
    vector<pair<double,double> > tv;
    vector<pair<double,int> > q;
    scanf("%d",&N);
    for(int n=0;n<N;n++) {
        double t,v;
        scanf("%lf %lf",&t,&v);
        tv.push_back(make_pair(t,v));
    }
    tv.push_back(make_pair(DBL_MAX_M,0));
    scanf("%d",&Q);
    for(int i=0;i<Q;i++) {
        double qa;
        scanf("%lf",&qa);
        q.push_back(make_pair(qa,i));
    }
    sort(tv.begin(),tv.end());
    sort(q.begin(),q.end());
    int qi=0;
    int tvi = 0;
    double t1 = 0;
    double currV = 0;
    double prevVT = 0;
    double prevY = 0;
    while(true) {
        while(qi<Q && q[qi].first<tv[tvi].first) {
            //printf("%lf\n",q[qi].first);
            double t2 = q[qi].first;
            double t = (t2-t1);
            double y = (-9.81)*t*t*0.5+currV*t+prevY;
            sprintf(answerBuffer[q[qi].second],"%.3lf %.3lf",(t2*5),y);
            qi++;
        }
        //printf("%d\n",qi);
        //cout<<qi<<endl;
        if(qi==Q)break;
        double tt = (tv[tvi].first-t1);
        prevY = (-9.81)*tt*tt*0.5+currV*tt+prevY;
        prevVT = prevVT+currV*(tv[tvi].first-t1);
        t1 = tv[tvi].first;
        currV = tv[tvi].second;
        tvi++;
    }

    for(int i=0;i<Q;i++)printf("%s\n",answerBuffer[i]);

    return 0;
}