Problem: Mr. Denjiro is a science teacher. Today he has just received a specially ordered water tank that will certainly be useful for his innovative experiments on water flow.

<image>
---
Figure 1: The water tank

The size of the tank is 100cm (Width) * 50cm (Height) * 30cm (Depth) (see Figure 1). For the experiments, he fits several partition boards inside of the tank parallel to the sideboards. The width of each board is equal to the depth of the tank, i.e. 30cm. The height of each board is less than that of the tank, i.e. 50 cm, and differs one another. The boards are so thin that he can neglect the thickness in the experiments.

<image>
---
Figure 2: The front view of the tank

The front view of the tank is shown in Figure 2.

There are several faucets above the tank and he turns them on at the beginning of his experiment. The tank is initially empty. Your mission is to write a computer program to simulate water flow in the tank.



Input

The input consists of multiple data sets. D is the number of the data sets.

D
DataSet1
DataSet2
...
DataSetD


The format of each data set (DataSetd , 1 <= d <= D) is as follows.

N
B1 H1
B2 H2
...
BN HN
M
F1 A1
F2 A2
...
FM AM
L
P1 T1
P2 T2
...
PL TL


Each line in the data set contains one or two integers.

N is the number of the boards he sets in the tank . Bi and Hi are the x-position (cm) and the height (cm) of the i-th board, where 1 <= i <= N .

Hi s differ from one another. You may assume the following.

> 0 < N < 10 ,
>  0 < B1 < B2 < ... < BN < 100 ,
>  0 < H1 < 50 , 0 < H2 < 50 , ..., 0 < HN < 50.

M is the number of the faucets above the tank . Fj and Aj are the x-position (cm) and the amount of water flow (cm3/second) of the j-th faucet , where 1 <= j <= M .

There is no faucet just above any boards . Namely, none of Fj is equal to Bi .

You may assume the following .

> 0 < M <10 ,
>  0 < F1 < F2 < ... < FM < 100 ,
>  0 < A1 < 100, 0 < A2 < 100, ... 0 < AM < 100.

L is the number of observation time and location. Pk is the x-position (cm) of the k-th observation point. Tk is the k-th observation time in seconds from the beginning.

None of Pk is equal to Bi .

You may assume the following .

> 0 < L < 10 ,
>  0 < P1 < 100, 0 < P2 < 100, ..., 0 < PL < 100 ,
>  0 < T1 < 1000000, 0 < T2 < 1000000, ... , 0 < TL < 1000000.

Output

For each data set, your program should output L lines each containing one real number which represents the height (cm) of the water level specified by the x-position Pk at the time Tk.

Each answer may not have an error greater than 0.001. As long as this condition is satisfied, you may output any number of digits after the decimal point.

After the water tank is filled to the brim, the water level at any Pk is equal to the height of the tank, that is, 50 cm.

Example

Input

2
5
15 40
35 20
50 45
70 30
80 10
3
20 3
60 2
65 2
6
40 4100
25 7500
10 18000
90 7000
25 15000
25 22000
5
15 40
35 20
50 45
70 30
80 10
2
60 4
75 1
3
60 6000
75 6000
85 6000


Output

0.666667
21.4286
36.6667
11.1111
40.0
50.0
30.0
13.3333
13.3333

Solution (in CPP):

Solution:
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <stack>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <sstream>
using namespace std;

#define REP(i,a,n) for(i=a; i<n; i++)
#define rep(i,n) REP(i,0,n)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define foreach(it,x) for(typeof(x.begin()) it=x.begin(); it!=x.end(); it++)

struct _node{
    int lb, rb, mb;
} node[1<<10];

bool used[1<<10];
int N,M,L, b[11], h[11], f[11], a[11], p[11],t[11];


void input(){
    int i;

    b[0] = 0, h[0] = 50;
    cin >> N;
    REP(i,1,N+1) cin >> b[i] >> h[i];
    b[N+1] = 100, h[N+1] = 50;

    cin >> M;
    rep(i,M) cin >> f[i] >> a[i];

    cin >> L;
    rep(i,L) cin >> p[i] >> t[i];
}

// ÍÍ(x1, x2)Ì¤¿ÅåÌ³ÌæØèÂÌidðÔ·
int findmax(int x1, int x2){
    int res = -1, tmp = 0;
    int i;

    REP(i,1,N+1) if( x1 < b[i] && b[i] < x2 ) {
        if( tmp < h[i] ){
            res = i;
            tmp = h[i];
        }
    }
    return res;
}

void build_tree(){
    int i;

    memset(used, false, sizeof(used));

    node[0].lb = 0;
    node[0].rb = N+1;
    node[0].mb = findmax(b[0], b[N+1]);
    used[0] = true;

    rep(i,1<<(N-1)) if( used[i] ) { // úð¢Äm[hªN-1ÂÅ«éÍ¸
        // ¶¤ð²×é
        int id = findmax(b[node[i].lb], b[node[i].mb]);
        if( id != -1 ){
            node[2*i+1].lb = node[i].lb;
            node[2*i+1].rb = node[i].mb;
            node[2*i+1].mb = id;
            used[2*i+1] = true;
        }

        // E¤ð²×é
        id = findmax(b[node[i].mb], b[node[i].rb]);
        if( id != -1 ){
            node[2*i+2].lb = node[i].mb;
            node[2*i+2].rb = node[i].rb;
            node[2*i+2].mb = id;
            used[2*i+2] = true;
        }
        //printf("i = %d, ¶ = %d, E = %d\n",i,used[2*i+1],used[2*i+2]);
    }
}


// (x1, x2)ÌÍÍÉüé1b ½èÌÊð²×é
int getwater(int x1, int x2){
    int i, res = 0;

    rep(i,M){
        if( x1 < f[i] && f[i] < x2 ){
            res += a[i];
        }
    }
    return res;
}

// lc,rcÍe©ç¬êÄ«½ÊAK¸Ç¿ç©Í0
double solve(int id, int px, int time, int lc, int rc){
    int la = lc + time * getwater(b[node[id].lb], b[node[id].mb]); // ¶¤ÉüéÊð²×é
    int ra = rc + time * getwater(b[node[id].mb], b[node[id].rb]); // E¤ÉüéÊð²×é

    // ¶¤ªìêéÀEl
    int tmp_l = (b[node[id].mb] - b[node[id].lb]) * h[node[id].mb] * 30;

    // E¤ªìêéÀEl
    int tmp_r = (b[node[id].rb] - b[node[id].mb]) * h[node[id].mb] * 30;

    if( (tmp_l + tmp_r) <= (la + ra) ){ // ¼ûìê½
        return min(50.0, (double)(la + ra) / (double)((b[node[id].rb] - b[node[id].lb]) * 30));
    }

    // ìê½Ù¤Ì³ðßéê
    if( (tmp_l <= la && b[node[id].lb] < px && px < b[node[id].mb] ||
         tmp_r <= ra && b[node[id].mb] < px && px < b[node[id].rb]) ){
        return (double)h[node[id].mb];
    }

    if( px < b[node[id].mb] ){ // ¶Ìq
        if( !used[2*id+1] ) return (double)(la+max(ra-tmp_r,0)) / (double)((b[node[id].mb] - b[node[id].lb]) * 30);
        return solve(2*id+1, px, time, lc, max(ra-tmp_r,0)); // ÓF½]
    }
    else{ // EÌq
        //printf("(rc=%d + ra=%d) / (%d - %d) * 30 = %lf\n",rc,ra,node[id].rb, node[id]
        if( !used[2*id+2] ) return (double)(ra+max(la-tmp_l,0)) / (double)((b[node[id].rb] - b[node[id].mb]) * 30);
        return solve(2*id+2, px, time, max(la-tmp_l,0), rc); 
    }
}


int main(){
    int D,i,j;

    cin >> D;
    while( D-- ){
        input();
        build_tree();

        rep(i,L){
            printf("%lf\n",solve(0,p[i],t[i],0,0));
        }
    }
    

    return 0;
}