#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const double eps = 1e-10;
double node[maxn << 2], lazy[maxn << 2], mul[maxn << 2];
int dcmp(double x) {
  if (fabs(x) < eps) return 0;
  return x > 0 ? 1 : -1;
}
void modify(int rt, int l, int r, double c) {
  lazy[rt] += c;
  node[rt] += c * (r - l + 1);
}
void modify1(int rt, double c) {
  mul[rt] *= c;
  lazy[rt] *= c;
  node[rt] *= c;
}
void pushup(int rt) { node[rt] = node[rt << 1] + node[rt << 1 | 1]; }
void pushdown(int rt, int l, int r) {
  if (dcmp(mul[rt] - 1)) {
    modify1(rt << 1, mul[rt]);
    modify1(rt << 1 | 1, mul[rt]);
    mul[rt] = 1;
  }
  if (dcmp(lazy[rt])) {
    int m = (l + r) >> 1;
    modify(rt << 1, l, m, lazy[rt]);
    modify(rt << 1 | 1, m + 1, r, lazy[rt]);
    lazy[rt] = 0;
  }
}
void build(int rt, int l, int r) {
  lazy[rt] = 0;
  mul[rt] = 1;
  if (l == r) {
    int a;
    scanf("%d", &a);
    node[rt] = a;
    return;
  }
  int m = (l + r) >> 1;
  build(rt << 1, l, m);
  build(rt << 1 | 1, m + 1, r);
  pushup(rt);
}
void update(int rt, int l, int r, int x, int y, double c) {
  if (x <= l && r <= y) {
    modify(rt, l, r, c);
    return;
  }
  pushdown(rt, l, r);
  int m = (l + r) >> 1;
  if (x <= m) update(rt << 1, l, m, x, y, c);
  if (m < y) update(rt << 1 | 1, m + 1, r, x, y, c);
  pushup(rt);
}
void update1(int rt, int l, int r, int x, int y, double c) {
  if (x <= l && r <= y) {
    modify1(rt, c);
    return;
  }
  pushdown(rt, l, r);
  int m = (l + r) >> 1;
  if (x <= m) update1(rt << 1, l, m, x, y, c);
  if (m < y) update1(rt << 1 | 1, m + 1, r, x, y, c);
  pushup(rt);
}
double query(int rt, int l, int r, int x, int y) {
  if (x <= l && r <= y) return node[rt];
  pushdown(rt, l, r);
  int m = (l + r) >> 1;
  double ret = 0;
  if (x <= m) ret += query(rt << 1, l, m, x, y);
  if (m < y) ret += query(rt << 1 | 1, m + 1, r, x, y);
  return ret;
}
int main() {
  int n, q;
  scanf("%d%d", &n, &q);
  build(1, 1, n);
  while (q--) {
    int op, l1, r1, l2, r2;
    scanf("%d%d%d", &op, &l1, &r1);
    if (op == 1) {
      scanf("%d%d", &l2, &r2);
      double c1 = query(1, 1, n, l1, r1) / (r1 - l1 + 1),
             c2 = query(1, 1, n, l2, r2) / (r2 - l2 + 1);
      update1(1, 1, n, l1, r1, (double)(r1 - l1) / (r1 - l1 + 1));
      update(1, 1, n, l1, r1, c2 / (r1 - l1 + 1));
      update1(1, 1, n, l2, r2, (double)(r2 - l2) / (r2 - l2 + 1));
      update(1, 1, n, l2, r2, c1 / (r2 - l2 + 1));
    } else
      printf("%.10f\n", query(1, 1, n, l1, r1));
  }
  return 0;
}
