#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
struct Seg {
  double rate;
  double add;
  double sum;
  inline void Up(double r, double a, int l) {
    sum = sum * r + a * l;
    add = add * r + a;
    rate *= r;
  }
} st[maxn << 2];
inline void Pushup(int rt) {
  st[rt].sum = st[(rt << 1)].sum + st[(rt << 1 | 1)].sum;
}
inline void Build(int L, int R, int rt) {
  st[rt].rate = 1;
  if (L == R) {
    cin >> st[rt].sum;
    return;
  }
  int Mid = L + R >> 1;
  ;
  Build(L, Mid, (rt << 1));
  Build(Mid + 1, R, (rt << 1 | 1));
  Pushup(rt);
}
ostream& operator<<(ostream& out, const Seg& A) {
  out << "rate :" << A.rate << "add:" << A.add << "sum:" << A.sum << endl;
  return out;
}
inline void Modify(int L, int R, int l, int r, double a, double b, int rt) {
  if (l <= L && r >= R) {
    st[rt].Up(b, a, (R - L + 1));
    return;
  }
  int Mid = L + R >> 1;
  ;
  double& _r = st[rt].rate;
  double& _add = st[rt].add;
  st[(rt << 1)].Up(_r, _add, (Mid - L + 1));
  st[(rt << 1 | 1)].Up(_r, _add, (R - Mid));
  _r = 1, _add = 0;
  if (l <= Mid) Modify(L, Mid, l, r, a, b, (rt << 1));
  if (r > Mid) Modify(Mid + 1, R, l, r, a, b, (rt << 1 | 1));
  Pushup(rt);
}
inline double Query(int L, int R, int l, int r, int rt) {
  if (l <= L && r >= R) {
    return st[rt].sum;
  }
  int Mid = L + R >> 1;
  ;
  double& _r = st[rt].rate;
  double& _add = st[rt].add;
  st[(rt << 1)].Up(_r, _add, (Mid - L + 1));
  st[(rt << 1 | 1)].Up(_r, _add, (R - Mid));
  _r = 1, _add = 0;
  double re = 0;
  if (l <= Mid) re = Query(L, Mid, l, r, (rt << 1));
  if (r > Mid) re += Query(Mid + 1, R, l, r, (rt << 1 | 1));
  return re;
}
int main() {
  cout << fixed;
  int n, q;
  cin >> n >> q;
  Build(1, n, 1);
  while (q--) {
    int op;
    cin >> op;
    if (op == 1) {
      int l1, r1, l2, r2;
      cin >> l1 >> r1 >> l2 >> r2;
      double s1 = Query(1, n, l2, r2, 1) / (r2 - l2 + 1.0) / (r1 - l1 + 1.0);
      double s2 = Query(1, n, l1, r1, 1) / (r2 - l2 + 1.0) / (r1 - l1 + 1.0);
      Modify(1, n, l1, r1, s1, 1.0 * (r1 - l1) / (r1 - l1 + 1.0), 1);
      Modify(1, n, l2, r2, s2, 1.0 * (r2 - l2) / (r2 - l2 + 1.0), 1);
    } else {
      int l, r;
      cin >> l >> r;
      cout << Query(1, n, l, r, 1) << endl;
      ;
    }
  }
  return 0;
}
