#include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1);
const int INF = 2e9 + 5;
const long long LINF = 1e18 + 5;
const long long MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
int n;
double a[MAXN];
double lp[4 * MAXN];
double sp[4 * MAXN];
double t[4 * MAXN];
int lazy[4 * MAXN];
void build(int nodo, int l, int r) {
  sp[nodo] = 0.0;
  lp[nodo] = 1.0;
  lazy[nodo] = 0;
  if (r - l < 2) {
    t[nodo] = a[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(nodo << 1, l, mid);
  build(nodo << 1 | 1, mid, r);
  t[nodo] = t[nodo << 1] + t[nodo << 1 | 1];
}
void update(int nodo, int a, int b, int l, int r, double f, double s) {
  if (lazy[nodo]) {
    t[nodo] = lp[nodo] * t[nodo] + sp[nodo] * (b - a);
    if (b - a > 1) {
      lazy[nodo << 1] = 1;
      lazy[nodo << 1 | 1] = 1;
      lp[nodo << 1] = lp[nodo << 1] * lp[nodo];
      lp[nodo << 1 | 1] = lp[nodo << 1 | 1] * lp[nodo];
      sp[nodo << 1] = sp[nodo << 1] * lp[nodo] + sp[nodo];
      sp[nodo << 1 | 1] = sp[nodo << 1 | 1] * lp[nodo] + sp[nodo];
    }
    lazy[nodo] = 0;
    sp[nodo] = 0.0;
    lp[nodo] = 1.0;
  }
  if (a >= b || r <= a || l >= b) return;
  if (l <= a && b <= r) {
    t[nodo] = f * t[nodo] + s * (b - a);
    if (b - a > 1) {
      lazy[nodo << 1] = 1;
      lazy[nodo << 1 | 1] = 1;
      lp[nodo << 1] = lp[nodo << 1] * f;
      lp[nodo << 1 | 1] = lp[nodo << 1 | 1] * f;
      sp[nodo << 1] = sp[nodo << 1] * f + s;
      sp[nodo << 1 | 1] = sp[nodo << 1 | 1] * f + s;
    }
    return;
  }
  int mid = (a + b) >> 1;
  update(nodo << 1, a, mid, l, r, f, s);
  update(nodo << 1 | 1, mid, b, l, r, f, s);
  t[nodo] = t[nodo << 1] + t[nodo << 1 | 1];
}
double Query(int nodo, int a, int b, int l, int r) {
  if (lazy[nodo]) {
    t[nodo] = lp[nodo] * t[nodo] + sp[nodo] * (b - a);
    if (b - a > 1) {
      lazy[nodo << 1] = 1;
      lazy[nodo << 1 | 1] = 1;
      lp[nodo << 1] = lp[nodo << 1] * lp[nodo];
      lp[nodo << 1 | 1] = lp[nodo << 1 | 1] * lp[nodo];
      sp[nodo << 1] = sp[nodo << 1] * lp[nodo] + sp[nodo];
      sp[nodo << 1 | 1] = sp[nodo << 1 | 1] * lp[nodo] + sp[nodo];
    }
    lazy[nodo] = 0;
    sp[nodo] = 0.0;
    lp[nodo] = 1.0;
  }
  if (a >= b || r <= a || l >= b) return 0;
  if (l <= a && b <= r) {
    return t[nodo];
  }
  int mid = (a + b) >> 1;
  double q1 = Query(nodo << 1, a, mid, l, r);
  double q2 = Query(nodo << 1 | 1, mid, b, l, r);
  return q1 + q2;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  int Q;
  cin >> n >> Q;
  for (int i = 0; i < n; ++i) cin >> a[i];
  build(1, 0, n);
  int tipo;
  int l1, l2, r1, r2;
  int l, r;
  for (int q = 0; q < Q; ++q) {
    cin >> tipo;
    if (tipo == 1) {
      cin >> l1 >> r1 >> l2 >> r2;
      --l1, --l2;
      int n1 = r1 - l1;
      int n2 = r2 - l2;
      double v1 = Query(1, 0, n, l1, r1);
      double v2 = Query(1, 0, n, l2, r2);
      v1 /= n1;
      v2 /= n2;
      double f2 = (n2 - 1.0) / (1.0 * n2);
      double f1 = (n1 - 1.0) / (1.0 * n1);
      update(1, 0, n, l2, r2, f2, v1 / n2);
      update(1, 0, n, l1, r1, f1, v2 / n1);
    } else {
      cin >> l >> r;
      --l;
      cout << fixed << setprecision(12) << Query(1, 0, n, l, r) << endl;
    }
  }
  return 0;
}
