Problem: Bertown is under siege! The attackers have blocked all the ways out and their cannon is bombarding the city. Fortunately, Berland intelligence managed to intercept the enemies' shooting plan. Let's introduce the Cartesian system of coordinates, the origin of which coincides with the cannon's position, the Ox axis is directed rightwards in the city's direction, the Oy axis is directed upwards (to the sky). The cannon will make n more shots. The cannon balls' initial speeds are the same in all the shots and are equal to V, so that every shot is characterized by only one number alphai which represents the angle at which the cannon fires. Due to the cannon's technical peculiarities this angle does not exceed 45 angles (π / 4). We disregard the cannon sizes and consider the firing made from the point (0, 0).

The balls fly according to the known physical laws of a body thrown towards the horizon at an angle: 

vx(t) = V·cos(alpha) vy(t) = V·sin(alpha) – g·t x(t) = V·cos(alpha)·t y(t) = V·sin(alpha)·t – g·t2 / 2

Think of the acceleration of gravity g as equal to 9.8.

Bertown defends m walls. The i-th wall is represented as a vertical segment (xi, 0) - (xi, yi). When a ball hits a wall, it gets stuck in it and doesn't fly on. If a ball doesn't hit any wall it falls on the ground (y = 0) and stops. If the ball exactly hits the point (xi, yi), it is considered stuck. 

Your task is to find for each ball the coordinates of the point where it will be located in the end.

Input

The first line contains integers n and V (1 ≤ n ≤ 104, 1 ≤ V ≤ 1000) which represent the number of shots and the initial speed of every ball. The second line contains n space-separated real numbers alphai (0 < alphai < π / 4) which represent the angles in radians at which the cannon will fire. The third line contains integer m (1 ≤ m ≤ 105) which represents the number of walls. Then follow m lines, each containing two real numbers xi and yi (1 ≤ xi ≤ 1000, 0 ≤ yi ≤ 1000) which represent the wall’s coordinates. All the real numbers have no more than 4 decimal digits. The walls may partially overlap or even coincide.

Output

Print n lines containing two real numbers each — calculate for every ball the coordinates of its landing point. Your answer should have the relative or absolute error less than 10 - 4.

Examples

Input

2 10
0.7853
0.3
3
5.0 5.0
4.0 2.4
6.0 1.9


Output

5.000000000 2.549499369
4.000000000 0.378324889


Input

2 10
0.7853
0.3
2
4.0 2.4
6.0 1.9


Output

10.204081436 0.000000000
4.000000000 0.378324889

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n;
long double V;
long double vx[111111], vy[111111];
int m, N;
struct point {
  long double x, y;
  bool operator<(const point &b) const {
    return (x != b.x) ? (x < b.x) : (y > b.y);
  }
} ans[111111], a[111111];
pair<long double, int> k[111111], b[111111], c[111111];
long double cs[111111];
int main() {
  double V2;
  scanf("%d%lf", &n, &V2);
  V = V2;
  for (int i = 1; i <= n; ++i) {
    double ang;
    scanf("%lf", &ang);
    long double t = ang;
    long double x = cos(t) * V * sin(t) * V / (0.5 * (9.8));
    ans[i].x = x;
    ans[i].y = 0;
    k[i] = make_pair(tan(ang), i);
  }
  scanf("%d", &m);
  long double mn = 1e9;
  int arc = 0;
  for (int i = 1; i <= m; ++i) {
    double x, y;
    scanf("%lf%lf", &x, &y);
    a[i].x = x;
    a[i].y = y;
    long double A = 0.5 * (9.8) * x * x;
    long double B = -x * V * V;
    long double C = 0.5 * x * x * (9.8) + y * V * V;
    long double D = B * B - 4 * A * C;
    if (D < 0) {
      if (x < mn) {
        mn = x;
        arc = i;
      }
    } else {
      b[++N] = make_pair((sqrt(D) - B) / 2 / A, i);
      c[N] = make_pair((-sqrt(D) - B) / 2 / A, i);
    }
  }
  sort(k + 1, k + 1 + n);
  sort(b + 1, b + 1 + N);
  int j = 0;
  long double mn2 = mn;
  for (int i = 1; i <= n; ++i) {
    for (; j < N && b[j + 1].first <= k[i].first;) {
      ++j;
      mn = min(a[b[j].second].x, mn);
    }
    int pos = k[i].second;
    if (mn < ans[pos].x) {
      ans[pos].x = mn;
      ans[pos].y = mn * k[i].first - 0.5 * (9.8) * mn * mn *
                                         (1 + k[i].first * k[i].first) / V / V;
    }
  }
  sort(c + 1, c + 1 + N);
  j = N + 1;
  mn = mn2;
  for (int i = n; i >= 1; --i) {
    for (; j > 1 && c[j - 1].first >= k[i].first;)
      mn = min(a[c[--j].second].x, mn);
    int pos = k[i].second;
    if (mn < ans[pos].x) {
      ans[pos].x = mn;
      ans[pos].y = mn * k[i].first - 0.5 * (9.8) * mn * mn *
                                         (1 + k[i].first * k[i].first) / V / V;
    }
  }
  for (int i = 1; i <= n; ++i) {
    double x = ans[i].x, y = ans[i].y;
    printf("%lf %lf\n", x, y);
  }
}