#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, q, a[maxn];
struct node {
  double sum;
  double lazyMult, lazySum;
} seg[4 * maxn];
void build(int idx, int i, int j) {
  seg[idx].lazyMult = 1.0;
  seg[idx].lazySum = 0;
  if (i == j) {
    seg[idx].sum = a[i];
    return;
  }
  int mid = (i + j) >> 1;
  int left = idx << 1;
  int right = left | 1;
  build(left, i, mid);
  build(right, mid + 1, j);
  seg[idx].sum = seg[left].sum + seg[right].sum;
}
void refresh(int idx, int i, int j) {
  int left = idx << 1;
  int right = left | 1;
  double mult = seg[idx].lazyMult;
  double sum = seg[idx].lazySum;
  if (i != j) {
    seg[left].lazyMult *= mult;
    seg[right].lazyMult *= mult;
    seg[left].lazySum = seg[left].lazySum * mult + sum;
    seg[right].lazySum = seg[right].lazySum * mult + sum;
  }
  seg[idx].sum *= mult;
  seg[idx].sum += sum * (j - i + 1);
  seg[idx].lazySum = 0;
  seg[idx].lazyMult = 1.0;
}
void update(int idx, int i, int j, int l, int r, double mult, double add) {
  refresh(idx, i, j);
  if (i > j || j < l || r < i) return;
  if (l <= i && j <= r) {
    seg[idx].lazyMult *= mult;
    seg[idx].lazySum = seg[idx].lazySum * mult + add;
    refresh(idx, i, j);
    return;
  }
  int mid = (i + j) >> 1;
  int left = idx << 1;
  int right = left | 1;
  update(left, i, mid, l, r, mult, add);
  update(right, mid + 1, j, l, r, mult, add);
  seg[idx].sum = seg[left].sum + seg[right].sum;
}
double query(int idx, int i, int j, int l, int r) {
  refresh(idx, i, j);
  if (i > j || j < l || r < i) return 0LL;
  if (l <= i && j <= r) return seg[idx].sum;
  int mid = (i + j) >> 1;
  int left = idx << 1;
  int right = left | 1;
  return query(left, i, mid, l, r) + query(right, mid + 1, j, l, r);
}
int main() {
  cin.sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> q;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  build(1, 1, n);
  while (q--) {
    int type;
    cin >> type;
    if (type == 1) {
      int l1, r1, l2, r2;
      cin >> l1 >> r1 >> l2 >> r2;
      double sz1 = r1 - l1 + 1;
      double sz2 = r2 - l2 + 1;
      double sum1 = query(1, 1, n, l1, r1) / sz1;
      double sum2 = query(1, 1, n, l2, r2) / sz2;
      update(1, 1, n, l1, r1, (sz1 - 1) / sz1, sum2 / sz1);
      update(1, 1, n, l2, r2, (sz2 - 1) / sz2, sum1 / sz2);
    } else {
      int l, r;
      cin >> l >> r;
      cout << fixed << setprecision(10) << query(1, 1, n, l, r) << '\n';
    }
  }
  return 0;
}
