#include <bits/stdc++.h>
using std ::map;
using std ::priority_queue;
using std ::queue;
using std ::set;
using std ::string;
using std ::swap;
using std ::unordered_map;
using std ::vector;
template <typename Tp>
Tp Max(const Tp &a, const Tp &b) {
  return a > b ? a : b;
}
template <typename Tp>
Tp Min(const Tp &a, const Tp &b) {
  return a < b ? a : b;
}
template <typename Tp>
Tp Abs(const Tp &a) {
  return a > 0 ? a : -a;
}
template <typename Tp>
void Read(Tp &x) {
  Tp in = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    in = in * 10 + ch - '0';
    ch = getchar();
  }
  x = in * f;
}
const int SN = 100000 + 10;
double sum[SN << 2], add[SN << 2], mul[SN << 2];
int a[SN];
int n, m;
void pushup(int rt) { sum[rt] = sum[rt << 1] + sum[rt << 1 | 1]; }
void pushdown(int l, int r, int rt) {
  int mid = (l + r) >> 1;
  if (mul[rt] != 1) {
    sum[rt << 1] *= mul[rt];
    sum[rt << 1 | 1] *= mul[rt];
    add[rt << 1] *= mul[rt];
    add[rt << 1 | 1] *= mul[rt];
    mul[rt << 1] *= mul[rt];
    mul[rt << 1 | 1] *= mul[rt];
    mul[rt] = 1;
  }
  if (add[rt] != 0) {
    sum[rt << 1] += (mid - l + 1) * add[rt];
    sum[rt << 1 | 1] += (r - mid) * add[rt];
    add[rt << 1] += add[rt];
    add[rt << 1 | 1] += add[rt];
    add[rt] = 0;
  }
}
void build(int l, int r, int rt) {
  mul[rt] = 1;
  if (l == r) {
    sum[rt] = a[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, rt << 1), build(mid + 1, r, rt << 1 | 1);
  pushup(rt);
}
void Mul(int QL, int QR, double X, int l, int r, int rt) {
  if (QL <= l && QR >= r) {
    sum[rt] *= X;
    add[rt] *= X;
    mul[rt] *= X;
    return;
  }
  pushdown(l, r, rt);
  int mid = (l + r) >> 1;
  if (QL <= mid) Mul(QL, QR, X, l, mid, rt << 1);
  if (QR > mid) Mul(QL, QR, X, mid + 1, r, rt << 1 | 1);
  pushup(rt);
}
void Add(int QL, int QR, double X, int l, int r, int rt) {
  if (QL <= l && QR >= r) {
    sum[rt] += (r - l + 1) * X;
    add[rt] += X;
    return;
  }
  pushdown(l, r, rt);
  int mid = (l + r) >> 1;
  if (QL <= mid) Add(QL, QR, X, l, mid, rt << 1);
  if (QR > mid) Add(QL, QR, X, mid + 1, r, rt << 1 | 1);
  pushup(rt);
}
double Query(int QL, int QR, int l, int r, int rt) {
  if (QL <= l && QR >= r) return sum[rt];
  pushdown(l, r, rt);
  double ans = 0;
  int mid = (l + r) >> 1;
  if (QL <= mid) ans += Query(QL, QR, l, mid, rt << 1);
  if (QR > mid) ans += Query(QL, QR, mid + 1, r, rt << 1 | 1);
  return ans;
}
int main(int argc, const char *argv[]) {
  Read(n), Read(m);
  for (int i = 1; i <= n; i++) Read(a[i]);
  build(1, n, 1);
  int opt, l1, l2, r1, r2;
  while (m--) {
    Read(opt), Read(l1), Read(r1);
    if (opt == 2)
      printf("%.10lf\n", Query(l1, r1, 1, n, 1));
    else {
      Read(l2), Read(r2);
      long long L = r1 - l1 + 1, R = r2 - l2 + 1;
      double Lsum = Query(l1, r1, 1, n, 1);
      double Rsum = Query(l2, r2, 1, n, 1);
      Mul(l1, r1, 1.0 * (L - 1) / L, 1, n, 1);
      Mul(l2, r2, 1.0 * (R - 1) / R, 1, n, 1);
      Add(l1, r1, Rsum / (1.0 * L * R), 1, n, 1);
      Add(l2, r2, Lsum / (1.0 * L * R), 1, n, 1);
    }
  }
  return 0;
}
