#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n, q, L[maxn << 2], R[maxn << 2];
double sum[maxn << 2], add[maxn << 2], mul[maxn << 2];
void pushup(int o) { sum[o] = sum[o * 2] + sum[o * 2 + 1]; }
void pushdown(int o) {
  sum[o * 2] = sum[o * 2] * mul[o] + add[o] * (R[o * 2] - L[o * 2] + 1);
  sum[o * 2 + 1] =
      sum[o * 2 + 1] * mul[o] + add[o] * (R[o * 2 + 1] - L[o * 2 + 1] + 1);
  add[o * 2] = add[o * 2] * mul[o] + add[o];
  add[o * 2 + 1] = add[o * 2 + 1] * mul[o] + add[o];
  mul[o * 2] = mul[o * 2] * mul[o];
  mul[o * 2 + 1] = mul[o * 2 + 1] * mul[o];
  mul[o] = 1;
  add[o] = 0;
}
void build(int o, int l, int r) {
  L[o] = l;
  R[o] = r;
  add[o] = 0;
  mul[o] = 1;
  if (l == r) {
    cin >> sum[o];
    return;
  }
  int mid = (l + r) >> 1;
  build(o * 2, l, mid);
  build(o * 2 + 1, mid + 1, r);
  pushup(o);
}
double query(int o, int l, int r, int x, int y) {
  if (x <= l && r <= y) {
    return sum[o];
  }
  pushdown(o);
  int mid = (l + r) >> 1;
  double res = 0.0;
  if (x <= mid) res += query(o * 2, l, mid, x, y);
  if (y > mid) res += query(o * 2 + 1, mid + 1, r, x, y);
  return res;
}
void update1(int o, int l, int r, int x, int y, double v) {
  if (x <= l && r <= y) {
    sum[o] += v * (r - l + 1);
    add[o] += v;
    return;
  }
  pushdown(o);
  int mid = (l + r) >> 1;
  if (x <= mid) update1(o * 2, l, mid, x, y, v);
  if (y > mid) update1(o * 2 + 1, mid + 1, r, x, y, v);
  pushup(o);
}
void update2(int o, int l, int r, int x, int y, double v) {
  if (x <= l && r <= y) {
    add[o] *= v;
    sum[o] *= v;
    mul[o] *= v;
    return;
  }
  pushdown(o);
  int mid = (l + r) >> 1;
  if (x <= mid) update2(o * 2, l, mid, x, y, v);
  if (y > mid) update2(o * 2 + 1, mid + 1, r, x, y, v);
  pushup(o);
}
int main() {
  scanf("%d%d", &n, &q);
  build(1, 1, n);
  while (q--) {
    int l1, r1, l2, r2;
    int id;
    scanf("%d", &id);
    if (id == 1) {
      scanf("%d%d%d%d", &l1, &r1, &l2, &r2);
      double sum1 = query(1, 1, n, l1, r1), sum2 = query(1, 1, n, l2, r2);
      double len1 = r1 - l1 + 1, len2 = r2 - l2 + 1;
      update2(1, 1, n, l1, r1, (len1 - 1) / len1);
      update2(1, 1, n, l2, r2, (len2 - 1) / len2);
      update1(1, 1, n, l1, r1, 1.0 / len1 * (sum2 / len2));
      update1(1, 1, n, l2, r2, 1.0 / len2 * (sum1 / len1));
    } else {
      scanf("%d%d", &l1, &r1);
      printf("%.7lf\n", query(1, 1, n, l1, r1));
    }
  }
  return 0;
}
