Problem: Vasya and Petya were tired of studying so they decided to play a game. Before the game begins Vasya looks at array a consisting of n integers. As soon as he remembers all elements of a the game begins. Vasya closes his eyes and Petya does q actions of one of two types:

1) Petya says 4 integers l1, r1, l2, r2 — boundaries of two non-intersecting segments. After that he swaps one random element from the [l1, r1] segment with another random element from the [l2, r2] segment.

2) Petya asks Vasya the sum of the elements of a in the [l, r] segment.

Vasya is a mathematician so he answers Petya the mathematical expectation of the sum of the elements in the segment.

Your task is to write a program which will answer the second type questions as Vasya would do it. In other words your program should print the mathematical expectation of the sum of the elements of a in the [l, r] segment for every second type query.

Input

The first line contains two integers n, q (2 ≤ n ≤ 105, 1 ≤ q ≤ 105) — the number of elements in the array and the number of queries you need to handle.

The second line contains n integers ai (1 ≤ ai ≤ 109) — elements of the array.

The next q lines contain Petya's actions of type 1 or 2.

If it is a type 1 action then the line contains 5 integers 1, l1, r1, l2, r2 (1 ≤ l1 ≤ r1 ≤ n, 1 ≤ l2 ≤ r2 ≤ n).

If it is a type 2 query then the line contains 3 integers 2, l, r (1 ≤ l ≤ r ≤ n).

It is guaranteed that there is at least one type 2 query and segments [l1, r1], [l2, r2] don't have common elements. 

Output

For each type 2 query print one real number — the mathematical expectation of the sum of elements in the segment.

Your answer will be considered correct if its absolute or relative error doesn't exceed 10 - 4 — formally, the answer is correct if <image> where x is jury's answer and y is yours.

Examples

Input

4 4
1 1 2 2
1 2 2 3 3
2 1 2
1 1 2 3 4
2 1 2


Output

3.0000000
3.0000000


Input

10 5
1 1 1 1 1 2 2 2 2 2
1 1 5 6 10
2 1 5
1 1 5 6 10
1 1 5 6 10
2 6 10


Output

6.0000000
8.0400000


Input

10 10
1 2 3 4 5 6 7 8 9 10
1 1 5 6 10
1 1 5 6 10
2 1 5
1 1 3 6 9
2 1 3
1 5 7 8 10
1 1 1 10 10
2 1 5
2 7 10
2 1 10


Output

23.0000000
14.0000000
28.0133333
21.5733333
55.0000000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
double it[4 * N], A[4 * N], B[4 * N], a[N];
void init(int k, int l, int r) {
  if (l == r) {
    it[k] = a[l];
    A[k] = 0.0;
    B[k] = 1.0;
    return;
  }
  int mid = (l + r) >> 1;
  int lc = k << 1, rc = lc | 1;
  init(lc, l, mid);
  init(rc, mid + 1, r);
  it[k] = it[lc] + it[rc];
  A[k] = 0.0;
  B[k] = 1.0;
}
void lazy(int k, int l, int r) {
  if (A[k] == 0.0 && B[k] == 1.0) return;
  it[k] = 1.0 * A[k] * (r - l + 1) + 1.0 * it[k] * B[k];
  if (l != r) {
    A[k << 1] = 1.0 * A[k << 1] * B[k] + A[k];
    A[(k << 1) | 1] = 1.0 * A[(k << 1) | 1] * B[k] + A[k];
    B[k << 1] *= B[k];
    B[(k << 1) | 1] *= B[k];
  }
  A[k] = 0.0;
  B[k] = 1.0;
}
void update(int k, int l, int r, int L, int R, double aa, double bb) {
  lazy(k, l, r);
  if (L > r || l > R || l > r) return;
  if (L <= l && r <= R) {
    it[k] = 1.0 * aa * (r - l + 1) + 1.0 * it[k] * bb;
    if (l != r) {
      A[k << 1] = 1.0 * A[k << 1] * bb + aa;
      A[(k << 1) | 1] = 1.0 * A[(k << 1) | 1] * bb + aa;
      B[k << 1] *= bb;
      B[(k << 1) | 1] *= bb;
    }
    return;
  }
  int mid = (l + r) >> 1;
  int lc = k << 1, rc = lc | 1;
  update(lc, l, mid, L, R, aa, bb);
  update(rc, mid + 1, r, L, R, aa, bb);
  it[k] = it[lc] + it[rc];
}
double get(int k, int l, int r, int L, int R) {
  lazy(k, l, r);
  if (L > r || l > R || l > r) return 0.0;
  if (L <= l && r <= R) return it[k];
  int mid = (l + r) >> 1;
  int lc = k << 1, rc = lc | 1;
  return (get(lc, l, mid, L, R) + get(rc, mid + 1, r, L, R));
}
signed main() {
  int n, q;
  cin >> n >> q;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  init(1, 1, n);
  for (int i = 1; i <= q; ++i) {
    int type, l1, r1;
    cin >> type >> l1 >> r1;
    if (type == 1) {
      int l2, r2;
      cin >> l2 >> r2;
      double aa1 = 1.0 * get(1, 1, n, l2, r2) /
                   (1.0 * (r2 - l2 + 1) * 1.0 * (r1 - l1 + 1));
      double aa2 = 1.0 * get(1, 1, n, l1, r1) /
                   (1.0 * (r2 - l2 + 1) * 1.0 * (r1 - l1 + 1));
      double bb1 = 1.0 * (r1 - l1) / (r1 - l1 + 1);
      double bb2 = 1.0 * (r2 - l2) / (r2 - l2 + 1);
      update(1, 1, n, l1, r1, aa1, bb1);
      update(1, 1, n, l2, r2, aa2, bb2);
    } else {
      printf("%.10lf\n", get(1, 1, n, l1, r1));
    }
  }
}