#include <bits/stdc++.h>
using namespace std;
const int N = 100010, M = 1000010, P = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const int INF = 0xcfcfcfcf;
const double eps = 1e-9, pi = asin(1) * 2;
int ADD(int a, int b) { return a + b >= P ? a + b - P : a + b; }
int MINUS(int a, int b) { return a - b < 0 ? a - b + P : a - b; }
int n, q;
int a[N];
bool equal(double a, double b) { return abs(a - b) <= eps; }
namespace SEGMENT_TREE {
double sum[N << 4], tag1[N << 4], tag2[N << 4];
void pushup(int p) { sum[p] = sum[(p << 1)] + sum[(p << 1 | 1)]; }
void build(int p, int l, int r) {
  tag1[p] = 1, tag2[p] = 0;
  if (l == r) {
    sum[p] = a[l];
    return;
  }
  int mid = l + r >> 1;
  build((p << 1), l, mid);
  build((p << 1 | 1), mid + 1, r);
  pushup(p);
}
void update1(int p, double v) { sum[p] *= v, tag1[p] *= v, tag2[p] *= v; }
void update2(int p, int len, double v) { sum[p] += len * v, tag2[p] += v; }
void pushdown(int p, int l, int r) {
  int mid = l + r >> 1;
  if (!equal(tag1[p], 1)) {
    update1((p << 1), tag1[p]);
    update1((p << 1 | 1), tag1[p]);
    tag1[p] = 1;
  }
  if (!equal(tag2[p], 0)) {
    update2((p << 1), mid - l + 1, tag2[p]);
    update2((p << 1 | 1), r - mid, tag2[p]);
    tag2[p] = 0;
  }
}
void update1(int p, int l, int r, int ql, int qr, double v) {
  if (ql <= l && r <= qr) return update1(p, v);
  pushdown(p, l, r);
  int mid = l + r >> 1;
  if (ql <= mid) update1((p << 1), l, mid, ql, qr, v);
  if (qr > mid) update1((p << 1 | 1), mid + 1, r, ql, qr, v);
  pushup(p);
}
void update2(int p, int l, int r, int ql, int qr, double v) {
  if (ql <= l && r <= qr) return update2(p, r - l + 1, v);
  pushdown(p, l, r);
  int mid = l + r >> 1;
  if (ql <= mid) update2((p << 1), l, mid, ql, qr, v);
  if (qr > mid) update2((p << 1 | 1), mid + 1, r, ql, qr, v);
  pushup(p);
}
double query(int p, int l, int r, int ql, int qr) {
  if (ql <= l && r <= qr) return sum[p];
  pushdown(p, l, r);
  int mid = l + r >> 1;
  double ans = 0;
  if (ql <= mid) ans += query((p << 1), l, mid, ql, qr);
  if (qr > mid) ans += query((p << 1 | 1), mid + 1, r, ql, qr);
  return ans;
}
}  // namespace SEGMENT_TREE
using SEGMENT_TREE::build;
using SEGMENT_TREE::query;
using SEGMENT_TREE::update1;
using SEGMENT_TREE::update2;
namespace IO {
long long read() {
  long long s = 0;
  bool flag = false;
  char ch = getchar();
  for (; ch < '0' || ch > '9'; ch = getchar())
    if (ch == '-') flag = true;
  for (; '0' <= ch && ch <= '9'; ch = getchar())
    s = (s << 3) + (s << 1) + (ch ^ '0');
  if (flag) return -s;
  return s;
}
}  // namespace IO
using IO::read;
int main() {
  n = read(), q = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  build(1, 1, n);
  for (int i = 1; i <= q; i++) {
    int opt = read();
    if (opt == 1) {
      int l1 = read(), r1 = read(), l2 = read(), r2 = read();
      int L1 = r1 - l1 + 1, L2 = r2 - l2 + 1;
      double E1 = query(1, 1, n, l1, r1), E2 = query(1, 1, n, l2, r2);
      update1(1, 1, n, l1, r1, 1.0 * (L1 - 1) / L1);
      update1(1, 1, n, l2, r2, 1.0 * (L2 - 1) / L2);
      update2(1, 1, n, l1, r1, E2 / L1 / L2);
      update2(1, 1, n, l2, r2, E1 / L1 / L2);
    }
    if (opt == 2) {
      int l = read(), r = read();
      printf("%.7lf\n", query(1, 1, n, l, r));
    }
  }
  return 0;
}
