#include <bits/stdc++.h>
using namespace std;
const int maxN = 100005;
int N, Q;
double E[maxN], segTree[maxN * 4];
pair<double, double> lazy[maxN * 4];
void build(int node, int left, int right) {
  lazy[node] = {1, 0};
  if (left == right) {
    segTree[node] = E[left];
    return;
  }
  int mid = (left + right) / 2;
  build(node * 2, left, mid);
  build(node * 2 + 1, mid + 1, right);
  segTree[node] = segTree[node * 2] + segTree[node * 2 + 1];
}
void update_lazy(int node, int left, int right, double& a, double& b) {
  segTree[node] = a * segTree[node] + b * (right - left + 1);
  lazy[node] = {lazy[node].first * a, lazy[node].second * a + b};
}
void update(int node, int left, int right, int& queryL, int& queryR, double& a,
            double& b) {
  if (right < queryL || left > queryR) return;
  if (queryL <= left && right <= queryR) {
    update_lazy(node, left, right, a, b);
    return;
  }
  int mid = (left + right) / 2;
  update_lazy(node * 2, left, mid, lazy[node].first, lazy[node].second);
  update_lazy(node * 2 + 1, mid + 1, right, lazy[node].first,
              lazy[node].second);
  lazy[node] = {1, 0};
  update(node * 2, left, mid, queryL, queryR, a, b);
  update(node * 2 + 1, mid + 1, right, queryL, queryR, a, b);
  segTree[node] = segTree[node * 2] + segTree[node * 2 + 1];
}
double query(int node, int left, int right, int& queryL, int& queryR) {
  if (queryL <= left && right <= queryR) return segTree[node];
  if (left > queryR || right < queryL) return 0;
  int mid = (left + right) / 2;
  update_lazy(node * 2, left, mid, lazy[node].first, lazy[node].second);
  update_lazy(node * 2 + 1, mid + 1, right, lazy[node].first,
              lazy[node].second);
  lazy[node] = {1, 0};
  double lval = query(node * 2, left, mid, queryL, queryR);
  double rval = query(node * 2 + 1, mid + 1, right, queryL, queryR);
  return lval + rval;
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> Q;
  for (int i = 1; i <= N; ++i) cin >> E[i];
  build(1, 1, N);
  while (Q--) {
    int op;
    cin >> op;
    if (op == 1) {
      int l1, r1, l2, r2;
      cin >> l1 >> r1 >> l2 >> r2;
      double s1 = query(1, 1, N, l1, r1);
      double s2 = query(1, 1, N, l2, r2);
      s1 /= r1 - l1 + 1;
      s1 /= r2 - l2 + 1;
      s2 /= r1 - l1 + 1;
      s2 /= r2 - l2 + 1;
      double a1 = (double)(r1 - l1) / (r1 - l1 + 1);
      double a2 = (double)(r2 - l2) / (r2 - l2 + 1);
      update(1, 1, N, l1, r1, a1, s2);
      update(1, 1, N, l2, r2, a2, s1);
    } else {
      int l, r;
      cin >> l >> r;
      printf("%.6f\n", query(1, 1, N, l, r));
    }
  }
  return 0;
}
