#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, q, a[N];
struct st {
  double t[4 * N], lazy[4 * N], lazy2[4 * N];
  void build_tree(int l, int r, int node) {
    if (l == r) {
      lazy[node] = 1;
      lazy2[node] = 0;
      t[node] = a[l];
      return;
    }
    int mid = (l + r) / 2;
    build_tree(l, mid, node * 2);
    build_tree(mid + 1, r, node * 2 + 1);
    t[node] = t[node * 2] + t[node * 2 + 1];
    lazy[node] = 1;
    lazy2[node] = 0;
  }
  void updlazy(int l, int r, int node) {
    if (l != r) {
      if (lazy[node] != 1 || lazy2[node] != 0) {
        int mid = (l + r) >> 1;
        t[node * 2] =
            t[node * 2] * lazy[node] + (double)(mid - l + 1) * lazy2[node];
        t[node * 2 + 1] =
            t[node * 2 + 1] * lazy[node] + (double)(r - mid) * lazy2[node];
        lazy[node * 2] *= lazy[node];
        lazy[node * 2 + 1] *= lazy[node];
        lazy2[node * 2] = lazy2[node * 2] * lazy[node] + lazy2[node];
        lazy2[node * 2 + 1] = lazy2[node * 2 + 1] * lazy[node] + lazy2[node];
        lazy[node] = 1;
        lazy2[node] = 0;
      }
    }
  }
  void upd(int l, int r, int s, int e, int node, double mul, double plus) {
    updlazy(l, r, node);
    if (l > r || l > e || r < s) return;
    if (s <= l && r <= e) {
      lazy[node] *= mul;
      lazy2[node] = lazy2[node] * mul + plus;
      t[node] = t[node] * mul + double(r - l + 1) * plus;
      return;
    }
    int mid = (l + r) / 2;
    upd(l, mid, s, e, node * 2, mul, plus);
    upd(mid + 1, r, s, e, node * 2 + 1, mul, plus);
    t[node] = t[node * 2] + t[node * 2 + 1];
  }
  double get(int l, int r, int s, int e, int node) {
    updlazy(l, r, node);
    if (l > r || l > e || r < s) return 0;
    if (s <= l && r <= e) return t[node];
    int mid = (l + r) / 2;
    return get(l, mid, s, e, node * 2) + get(mid + 1, r, s, e, node * 2 + 1);
  }
} st;
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(6);
  cin >> n >> q;
  for (int i = 0; i < n; i++) cin >> a[i];
  st.build_tree(0, n - 1, 1);
  while (q--) {
    int op;
    cin >> op;
    if (op == 1) {
      int l1, r1, l2, r2;
      cin >> l1 >> r1 >> l2 >> r2;
      l1--;
      r1--;
      l2--;
      r2--;
      double mul = (double)(r1 - l1) / (double)(r1 - l1 + 1);
      double add = st.get(0, n - 1, l2, r2, 1) / (double)(r2 - l2 + 1);
      add /= (double)(r1 - l1 + 1);
      double mul2 = (double)(r2 - l2) / (double)(r2 - l2 + 1);
      double add2 = st.get(0, n - 1, l1, r1, 1) / (double)(r1 - l1 + 1);
      add2 /= (double)(r2 - l2 + 1);
      st.upd(0, n - 1, l1, r1, 1, mul, add);
      st.upd(0, n - 1, l2, r2, 1, mul2, add2);
    } else {
      int l, r;
      cin >> l >> r;
      l--;
      r--;
      cout << st.get(0, n - 1, l, r, 1) << "\n";
    }
  }
  return 0;
}
