#include <bits/stdc++.h>
using namespace std;
double a[200007];
struct node {
  double v, mul, add;
} st[200000 * 5];
int sgn(double a, double b) { return fabs(a - b) < 1e-10; }
void bt(int root, int l, int r) {
  st[root].mul = 1;
  st[root].add = 0;
  if (l == r) {
    st[root].v = a[l];
  } else {
    int m = (l + r) / 2;
    bt(root * 2, l, m);
    bt(root * 2 + 1, m + 1, r);
    st[root].v = st[root * 2].v + st[root * 2 + 1].v;
  }
  return;
}
void pushdown(int root, int l, int r) {
  int m = (l + r) / 2;
  st[root * 2].v = (st[root * 2].v * st[root].mul + st[root].add * (m - l + 1));
  st[root * 2 + 1].v =
      (st[root * 2 + 1].v * st[root].mul + st[root].add * (r - m));
  st[root * 2].mul = (st[root * 2].mul * st[root].mul);
  st[root * 2 + 1].mul = (st[root * 2 + 1].mul * st[root].mul);
  st[root * 2].add = (st[root * 2].add * st[root].mul + st[root].add);
  st[root * 2 + 1].add = (st[root * 2 + 1].add * st[root].mul + st[root].add);
  st[root].mul = 1;
  st[root].add = 0;
  return;
}
void ud1(int root, int stdl, int stdr, int l, int r, double k) {
  if (r < stdl || stdr < l) {
    return;
  }
  if (l <= stdl && stdr <= r) {
    st[root].v = (st[root].v * k);
    st[root].mul = (st[root].mul * k);
    st[root].add = (st[root].add * k);
    return;
  }
  pushdown(root, stdl, stdr);
  int m = (stdl + stdr) / 2;
  ud1(root * 2, stdl, m, l, r, k);
  ud1(root * 2 + 1, m + 1, stdr, l, r, k);
  st[root].v = (st[root * 2].v + st[root * 2 + 1].v);
  return;
}
void ud2(int root, int stdl, int stdr, int l, int r, double k) {
  if (r < stdl || stdr < l) {
    return;
  }
  if (l <= stdl && stdr <= r) {
    st[root].add = (st[root].add + k);
    st[root].v = (st[root].v + k * (stdr - stdl + 1));
    return;
  }
  pushdown(root, stdl, stdr);
  int m = (stdl + stdr) / 2;
  ud2(root * 2, stdl, m, l, r, k);
  ud2(root * 2 + 1, m + 1, stdr, l, r, k);
  st[root].v = (st[root * 2].v + st[root * 2 + 1].v);
  return;
}
double query(int root, int stdl, int stdr, int l, int r) {
  if (r < stdl || stdr < l) {
    return 0;
  }
  if (l <= stdl && stdr <= r) {
    return st[root].v;
  }
  pushdown(root, stdl, stdr);
  int m = (stdl + stdr) / 2;
  return (query(root * 2, stdl, m, l, r) +
          query(root * 2 + 1, m + 1, stdr, l, r));
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%lf", &a[i]);
  }
  bt(1, 1, n);
  while (m--) {
    int chk;
    scanf("%d", &chk);
    int x, y;
    if (chk == 1) {
      int l1, r1, l2, r2;
      scanf("%d%d%d%d", &l1, &r1, &l2, &r2);
      double s1 = query(1, 1, n, l1, r1);
      double s2 = query(1, 1, n, l2, r2);
      double ave1 = s1 / (r1 - l1 + 1);
      double ave2 = s2 / (r2 - l2 + 1);
      int len1 = r1 - l1 + 1;
      int len2 = r2 - l2 + 1;
      ud1(1, 1, n, l1, r1, (len1 - 1) * 1.0 / len1);
      ud2(1, 1, n, l1, r1, ave2 * 1.0 / len1);
      ud1(1, 1, n, l2, r2, (len2 - 1) * 1.0 / len2);
      ud2(1, 1, n, l2, r2, ave1 * 1.0 / len2);
    } else if (chk == 2) {
      int l1, r1;
      scanf("%d%d", &l1, &r1);
      printf("%.10f\n", query(1, 1, n, l1, r1));
    }
  }
  getchar();
  getchar();
  return 0;
}
