#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const double eps = 1e-8;
double W, w;
struct Node {
  double sum, fl, delta;
  int sz;
};
Node pool[maxn << 2];
void push_up(int u) {
  int ls = u << 1, rs = ls | 1;
  pool[u].sum = pool[ls].sum + pool[rs].sum;
}
void push_down(int u) {
  if (pool[u].delta > eps) {
    int ls = u << 1, rs = ls | 1;
    double dl = pool[u].delta, fl = pool[u].fl;
    pool[u].delta = 0.0;
    pool[u].fl = 1.0;
    pool[ls].sum = pool[ls].sum * fl + dl * pool[ls].sz;
    pool[rs].sum = pool[rs].sum * fl + dl * pool[rs].sz;
    pool[ls].delta = pool[ls].delta * fl + dl;
    pool[rs].delta = pool[rs].delta * fl + dl;
    pool[ls].fl *= fl;
    pool[rs].fl *= fl;
  }
}
void build(int u, int L, int R) {
  pool[u].fl = 1.0;
  pool[u].delta = 0.0;
  if (L == R) {
    scanf("%lf", &W);
    pool[u].sum = 1.0 * W;
    pool[u].sz = 1;
    return;
  }
  int md = L + R >> 1, ls = u << 1, rs = ls | 1;
  build(ls, L, md);
  build(rs, md + 1, R);
  push_up(u);
  pool[u].sz = pool[ls].sz + pool[rs].sz;
}
void update(int u, int L, int R, int l, int r, double fl, double dl) {
  if (l <= L and R <= r) {
    pool[u].sum = pool[u].sum * fl + dl * pool[u].sz;
    pool[u].fl *= fl;
    pool[u].delta = pool[u].delta * fl + dl;
    return;
  }
  int md = L + R >> 1, ls = u << 1, rs = ls | 1;
  push_down(u);
  if (r <= md)
    update(ls, L, md, l, r, fl, dl);
  else if (md < l)
    update(rs, md + 1, R, l, r, fl, dl);
  else
    update(ls, L, md, l, r, fl, dl), update(rs, md + 1, R, l, r, fl, dl);
  push_up(u);
}
double calc(int u, int L, int R, int l, int r) {
  if (l <= L and R <= r) return pool[u].sum;
  push_down(u);
  int md = L + R >> 1, ls = u << 1, rs = ls | 1;
  if (r <= md)
    return calc(ls, L, md, l, r);
  else if (md < l)
    return calc(rs, md + 1, R, l, r);
  else
    return calc(ls, L, md, l, r) + calc(rs, md + 1, R, l, r);
}
int n, m, l1, r1, l2, r2, tp;
double f1, f2, d1, d2;
int main() {
  scanf("%d%d", &n, &m);
  build(1, 1, n);
  while (m--) {
    scanf("%d", &tp);
    if (tp == 1) {
      scanf("%d%d%d%d", &l1, &r1, &l2, &r2);
      W = calc(1, 1, n, l1, r1);
      w = calc(1, 1, n, l2, r2);
      f1 = 1.0 / (r1 - l1 + 1);
      f2 = 1.0 / (r2 - l2 + 1);
      d1 = w * f1 * f2;
      d2 = W * f1 * f2;
      f1 = f1 * (r1 - l1);
      f2 = f2 * (r2 - l2);
      update(1, 1, n, l1, r1, f1, d1);
      update(1, 1, n, l2, r2, f2, d2);
    } else {
      scanf("%d%d", &l1, &r1);
      printf("%.12lf\n", calc(1, 1, n, l1, r1));
    }
  }
  return 0;
}
