Problem: There are n casinos lined in a row. If Memory plays at casino i, he has probability pi to win and move to the casino on the right (i + 1) or exit the row (if i = n), and a probability 1 - pi to lose and move to the casino on the left (i - 1) or also exit the row (if i = 1). 

We say that Memory dominates on the interval i... j if he completes a walk such that,

  * He starts on casino i. 
  * He never looses in casino i. 
  * He finishes his walk by winning in casino j. 



Note that Memory can still walk left of the 1-st casino and right of the casino n and that always finishes the process.

Now Memory has some requests, in one of the following forms:

  * 1 i a b: Set <image>. 
  * 2 l r: Print the probability that Memory will dominate on the interval l... r, i.e. compute the probability that Memory will first leave the segment l... r after winning at casino r, if she starts in casino l. 



It is guaranteed that at any moment of time p is a non-decreasing sequence, i.e. pi ≤ pi + 1 for all i from 1 to n - 1.

Please help Memory by answering all his requests!

Input

The first line of the input contains two integers n and q(1 ≤ n, q ≤ 100 000), — number of casinos and number of requests respectively.

The next n lines each contain integers ai and bi (1 ≤ ai < bi ≤ 109) — <image> is the probability pi of winning in casino i.

The next q lines each contain queries of one of the types specified above (1 ≤ a < b ≤ 109, 1 ≤ i ≤ n, 1 ≤ l ≤ r ≤ n).

It's guaranteed that there will be at least one query of type 2, i.e. the output will be non-empty. Additionally, it is guaranteed that p forms a non-decreasing sequence at all times.

Output

Print a real number for every request of type 2 — the probability that boy will "dominate" on that interval. Your answer will be considered correct if its absolute error does not exceed 10 - 4.

Namely: let's assume that one of your answers is a, and the corresponding answer of the jury is b. The checker program will consider your answer correct if |a - b| ≤ 10 - 4.

Example

Input

3 13
1 3
1 2
2 3
2 1 1
2 1 2
2 1 3
2 2 2
2 2 3
2 3 3
1 2 2 3
2 1 1
2 1 2
2 1 3
2 2 2
2 2 3
2 3 3


Output

0.3333333333
0.2000000000
0.1666666667
0.5000000000
0.4000000000
0.6666666667
0.3333333333
0.2500000000
0.2222222222
0.6666666667
0.5714285714
0.6666666667

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
struct segtree {
  double a, b;
} seg[4 * maxn], now;
double p[maxn];
int n, q;
void build(int l, int r, int pos) {
  if (l == r) {
    seg[pos].a = seg[pos].b = (1 - p[l]) / p[l];
    return;
  }
  int mid = (l + r) / 2;
  build(l, mid, pos * 2);
  build(mid + 1, r, pos * 2 + 1);
  seg[pos].a = seg[2 * pos].a * seg[2 * pos + 1].a;
  seg[pos].b = seg[2 * pos].b + seg[2 * pos].a * seg[2 * pos + 1].b;
}
void query(int l, int r, int x, int y, int pos) {
  if (l == x && r == y) {
    now.b = now.b + now.a * seg[pos].b;
    now.a = now.a * seg[pos].a;
    return;
  }
  int mid = (l + r) / 2;
  if (y <= mid)
    query(l, mid, x, y, pos * 2);
  else if (x > mid)
    query(mid + 1, r, x, y, pos * 2 + 1);
  else {
    query(l, mid, x, mid, pos * 2);
    query(mid + 1, r, mid + 1, y, pos * 2 + 1);
  }
}
void update(int l, int r, int pos, int x) {
  if (l == r) {
    seg[pos].a = seg[pos].b = (1 - p[l]) / p[l];
    return;
  }
  int mid = (l + r) / 2;
  if (x <= mid)
    update(l, mid, 2 * pos, x);
  else
    update(mid + 1, r, 2 * pos + 1, x);
  seg[pos].a = seg[2 * pos].a * seg[2 * pos + 1].a;
  seg[pos].b = seg[2 * pos].b + seg[2 * pos].a * seg[2 * pos + 1].b;
}
int main() {
  int a, b;
  cin >> n >> q;
  for (int i = 1; i <= n; i++) {
    cin >> a >> b;
    p[i] = 1.0 * a / b;
  }
  build(1, n, 1);
  while (q--) {
    int order, x, y, z;
    cin >> order;
    if (order == 2) {
      cin >> x >> y;
      now.a = 1;
      now.b = 0;
      query(1, n, x, y, 1);
      double ans;
      if (now.b <= 1e15)
        ans = 1 / (1 + now.b);
      else
        ans = 0;
      printf("%.10lf\n", ans);
    } else {
      cin >> x >> y >> z;
      p[x] = 1.0 * y / z;
      update(1, n, 1, x);
    }
  }
  return 0;
}