Problem: The cool breeze blows gently, the flowing water ripples steadily.

"Flowing and passing like this, the water isn't gone ultimately; Waxing and waning like that, the moon doesn't shrink or grow eventually."

"Everything is transient in a way and perennial in another."

Kanno doesn't seem to make much sense out of Mino's isolated words, but maybe it's time that they enjoy the gentle breeze and the night sky — the inexhaustible gifts from nature.

Gazing into the sky of stars, Kanno indulges in a night's tranquil dreams. 

There is a set S of n points on a coordinate plane.

Kanno starts from a point P that can be chosen on the plane. P is not added to S if it doesn't belong to S. Then the following sequence of operations (altogether called a move) is repeated several times, in the given order:

  1. Choose a line l such that it passes through at least two elements in S and passes through Kanno's current position. If there are multiple such lines, one is chosen equiprobably. 
  2. Move to one of the points that belong to S and lie on l. The destination is chosen equiprobably among all possible ones, including Kanno's current position (if it does belong to S). 



There are q queries each consisting of two integers (t_i, m_i). For each query, you're to help Kanno maximize the probability of the stopping position being the t_i-th element in S after m_i moves with a proper selection of P, and output this maximum probability. Note that according to rule 1, P should belong to at least one line that passes through at least two points from S.

Input

The first line contains a positive integer n (2 ≤ n ≤ 200) — the number of points in S.

The i-th of the following n lines contains two space-separated integers x_i and y_i (-10^4 ≤ x_i, y_i ≤ 10^4) — the coordinates of the i-th point in S. The input guarantees that for all 1 ≤ i < j ≤ n, (x_i, y_i) ≠ (x_j, y_j) holds.

The next line contains a positive integer q (1 ≤ q ≤ 200) — the number of queries.

Each of the following q lines contains two space-separated integers t and m (1 ≤ t_i ≤ n, 1 ≤ m_i ≤ 10^4) — the index of the target point and the number of moves, respectively.

Output

Output q lines each containing a decimal number — the i-th among them denotes the maximum probability of staying on the t_i-th point after m_i steps, with a proper choice of starting position P.

Your answer will be considered correct if each number in your output differs from the corresponding one in jury's answer by at most 10^{-6}.

Formally, let your answer be a, and the jury's answer be b. Your answer is considered correct if |a - b| ≤ 10^{-6}.

Example

Input

5
0 0
1 3
2 2
3 1
4 4
10
1 1
2 1
3 1
4 1
5 1
3 2
3 3
3 4
3 5
3 6


Output

0.50000000000000000000
0.50000000000000000000
0.33333333333333331483
0.50000000000000000000
0.50000000000000000000
0.18518518518518517491
0.15226337448559670862
0.14494741655235482414
0.14332164812274550414
0.14296036624949901017

Note

The points in S and possible candidates for line l are depicted in the following figure.

<image>

For the first query, when P = (-1, -3), l is uniquely determined to be 3x = y, and thus Kanno will move to (0, 0) with a probability of \frac 1 2.

For the third query, when P = (2, 2), l is chosen equiprobably between x + y = 4 and x = y. Kanno will then move to the other four points with a probability of \frac 1 2 ⋅ \frac 1 3 = \frac 1 6 each, or stay at (2, 2) with a probability of \frac 1 3.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 200;
const int S = 20;
struct pt {
  long long x, y;
  pt(long long x = 0, long long y = 0) : x(x), y(y) {}
  pt operator-(const pt o) const { return pt(x - o.x, y - o.y); }
  long long cross(const pt o) const { return x * o.y - y * o.x; }
};
bool is_collinear(pt a, pt b, pt c) { return (a - b).cross(b - c) == 0; }
inline void muli(int n, int i, double c[N][N], double a[N][N], double b[N][N]) {
  for (int j = 0; j < n; j++) {
    c[i][j] = 0;
    for (int k = 0; k < n; k++) {
      c[i][j] += a[i][k] * b[k][j];
    }
  }
}
inline void mul(int n, double c[N][N], double a[N][N], double b[N][N]) {
  for (int i = 0; i < n; i++) muli(n, i, c, a, b);
}
double mat[N][N], tem[N][N];
double mpows[S + 1][N][N];
void raise(int n, int i, int m) {
  for (int j = 0; j < n; j++) mat[i][j] = i == j;
  for (int s = 0; m; m >>= 1, s++) {
    if (m & 1) {
      muli(n, i, tem, mat, mpows[s]);
      for (int j = 0; j < n; j++) mat[i][j] = tem[i][j];
    }
  }
}
vector<int> lines[N * N];
int parent[N * N];
int find(int i) { return parent[i] < 0 ? i : parent[i] = find(parent[i]); }
void onion(int i, int j) {
  if ((i = find(i)) == (j = find(j))) return;
  if (parent[i] == parent[j]) parent[j]--;
  if (parent[i] < parent[j]) swap(i, j);
  parent[i] = j;
}
inline bool is_special(int l) { return l == find(l); }
pt p[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n * n; i++) parent[i] = -1;
  for (int i = 0; i < n; i++) {
    scanf("%lld%lld", &p[i].x, &p[i].y);
    for (int j = 0; j < i; j++) {
      for (int k = 0; k < j; k++) {
        if (is_collinear(p[i], p[j], p[k])) {
          onion(((i)*n + (j)), ((i)*n + (k)));
          onion(((i)*n + (j)), ((j)*n + (k)));
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < i; j++) {
      if (is_special(((i)*n + (j)))) {
        for (int k = 0; k < n; k++) {
          if (is_collinear(p[i], p[j], p[k])) {
            lines[((i)*n + (j))].push_back(k);
          }
        }
      }
    }
  }
  for (int s = 0; s < n; s++) {
    int lc = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < i; j++) {
        if (is_special(((i)*n + (j)))) {
          if (is_collinear(p[s], p[i], p[j])) {
            double prob = 1.0 / lines[((i)*n + (j))].size();
            for (int k : lines[((i)*n + (j))]) mat[k][s] += prob;
            lc++;
          }
        }
      }
    }
    for (int i = 0; i < n; i++) {
      mat[i][s] /= lc;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      mpows[0][i][j] = mat[i][j];
    }
  }
  for (int s = 0; s < S; s++) {
    mul(n, mpows[s + 1], mpows[s], mpows[s]);
  }
  int q;
  scanf("%d", &q);
  for (int t, m; q--;) {
    scanf("%d%d", &t, &m);
    t--;
    double best = 0;
    raise(n, t, m - 1);
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < i; j++) {
        if (is_special(((i)*n + (j)))) {
          double curr = 0;
          for (int k : lines[((i)*n + (j))]) curr += mat[t][k];
          best = max(best, curr / lines[((i)*n + (j))].size());
        }
      }
    }
    printf("%.11lf\n", best);
  }
}