1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
using ll = long long;
using ii = pair<int, int>;
constexpr int MX = 21e4+5;

ii P[MX];
int R[105];

int main() {
	if (fopen("in", "r")) freopen("in", "r", stdin), freopen("out", "w", stdout);
	cin.tie(0)->sync_with_stdio(0);

    int N; cin >> N;
    for (int i = 0; i < N; ++i) cin >> P[i].f >> P[i].s;
    sort(P, P+N);
    int M; cin >> M;
    for (int i = 0; i < M; ++i) cin >> R[i];

    int sum = 0;
    for (int i = 0; i < M; ++i) sum += R[i];
    int j = 0;
    for (int i = 0; i < M; ++i) {
        int k = min(int(ceil(j+(double)R[i]/sum*N)), N);
        ii cen(0, 0);
        for (int a = j; a < k; ++a) {
            cen.f += P[a].f, cen.s += P[a].s;
        }
        double y = (double)cen.s / (k-j);
        if (i%3 == 0) y += 25;
        else if (i%3 == 1) y -= 25;
        cout << (double)cen.f / (k-j) << ' ' << y << '\n';
        j = k;
    }

}