#include <bits/stdc++.h>
using namespace std;
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int &x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et() {
  puts("-1");
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) {
  long long z = y;
  while (x % y != 0) {
    z = x % y;
    x = y;
    y = z;
  }
  return z;
}
int a[100005];
const int MN = 100005 << 2;
long double T[MN], f[MN], b[MN];
bool lz[MN];
void Up(int rt, int l, int r) { T[rt] = T[(rt << 1)] + T[(rt << 1 | 1)]; }
void build(int rt, int l, int r) {
  f[rt] = 1;
  if (l + 1 == r) {
    T[rt] = a[r];
    return;
  }
  int mid = (l + r) / 2;
  build((rt << 1), l, mid);
  build((rt << 1 | 1), mid, r);
  Up(rt, l, r);
}
void Down(int rt, int l, int r) {
  if (lz[rt]) {
    int mid = (l + r) / 2;
    f[(rt << 1)] = f[(rt << 1)] * f[rt];
    b[(rt << 1)] = f[rt] * b[(rt << 1)] + b[rt];
    T[(rt << 1)] = T[(rt << 1)] * f[rt] + b[rt] * (mid - l);
    lz[(rt << 1)] = 1;
    f[(rt << 1 | 1)] = f[(rt << 1 | 1)] * f[rt];
    b[(rt << 1 | 1)] = f[rt] * b[(rt << 1 | 1)] + b[rt];
    T[(rt << 1 | 1)] = T[(rt << 1 | 1)] * f[rt] + b[rt] * (r - mid);
    lz[(rt << 1 | 1)] = 1;
    lz[rt] = 0;
    f[rt] = 1;
    b[rt] = 0;
  }
}
void upt(int rt, int l, int r, int L, int R, long double K, long double B) {
  if (R <= l || r <= L) return;
  if (L <= l && r <= R) {
    f[rt] = f[rt] * K;
    b[rt] = K * b[rt] + B;
    T[rt] = T[rt] * K + B * (r - l);
    lz[rt] = 1;
    return;
  }
  Down(rt, l, r);
  int mid = (l + r) / 2;
  upt((rt << 1), l, mid, L, R, K, B);
  upt((rt << 1 | 1), mid, r, L, R, K, B);
  Up(rt, l, r);
}
long double qy(int rt, int l, int r, int L, int R) {
  if (R <= l || r <= L) return 0;
  if (L <= l && r <= R) {
    return T[rt];
  }
  Down(rt, l, r);
  int mid = (l + r) / 2;
  return qy((rt << 1), l, mid, L, R) + qy((rt << 1 | 1), mid, r, L, R);
}
void fmain(int ID) {
  scanf("%d%d", &n, &m);
  for (int(i) = 1; (i) <= (int)(n); (i)++) scanf("%d", a + i);
  build(1, 0, n);
  for (int(i) = 1; (i) <= (int)(m); (i)++) {
    int t, l, r, L, R;
    scanf("%d%d%d", &t, &l, &r);
    if (t == 1) {
      scanf("%d%d", &L, &R);
      long double v1 = qy(1, 0, n, l - 1, r);
      long double v2 = qy(1, 0, n, L - 1, R);
      int c1 = r - l + 1, c2 = R - L + 1;
      upt(1, 0, n, l - 1, r, (long double)(c1 - 1) / c1, v2 / c1 / c2);
      upt(1, 0, n, L - 1, R, (long double)(c2 - 1) / c2, v1 / c1 / c2);
    } else {
      printf("%.10Lf\n", qy(1, 0, n, l - 1, r));
    }
  }
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
