#include <bits/stdc++.h>
using namespace std;
long long n, g, t, l1, l2, r1, r2;
long long a[100005];
double seg[400005], lazyp[400005], lazyq[400005], p1, q1, p2, q2;
void build(long long i, long long l, long long r) {
  if (l == r) {
    seg[i] = (double)a[l];
    return;
  }
  long long mid = (l + r) / 2;
  build(2 * i, l, mid);
  build(2 * i + 1, mid + 1, r);
  seg[i] = seg[2 * i] + seg[2 * i + 1];
}
double query(long long i, long long l, long long r, long long x, long long y) {
  if ((lazyp[i] != (double)1) || lazyq[i]) {
    seg[i] = seg[i] * lazyp[i] + (double)(r - l + 1) * lazyq[i];
    if (l != r) {
      lazyp[2 * i] *= lazyp[i];
      lazyq[2 * i] = lazyq[2 * i] * lazyp[i] + lazyq[i];
      lazyp[2 * i + 1] *= lazyp[i];
      lazyq[2 * i + 1] = lazyq[2 * i + 1] * lazyp[i] + lazyq[i];
    }
    lazyp[i] = (double)1;
    lazyq[i] = (double)0;
  }
  if (l > y || x > r) return (double)0;
  if (l >= x && y >= r) return seg[i];
  long long mid = (l + r) / 2;
  return query(2 * i, l, mid, x, y) + query(2 * i + 1, mid + 1, r, x, y);
}
void update(long long i, long long l, long long r, long long x, long long y,
            double p, double q) {
  if ((lazyp[i] != (double)1) || lazyq[i]) {
    seg[i] = seg[i] * lazyp[i] + (double)(r - l + 1) * lazyq[i];
    if (l != r) {
      lazyp[2 * i] *= lazyp[i];
      lazyq[2 * i] = lazyq[2 * i] * lazyp[i] + lazyq[i];
      lazyp[2 * i + 1] *= lazyp[i];
      lazyq[2 * i + 1] = lazyq[2 * i + 1] * lazyp[i] + lazyq[i];
    }
    lazyp[i] = (double)1;
    lazyq[i] = (double)0;
  }
  if (l > y || x > r) return;
  if (l >= x && y >= r) {
    seg[i] = seg[i] * p + (double)(r - l + 1) * q;
    if (l != r) {
      lazyp[2 * i] *= p;
      lazyq[2 * i] = lazyq[2 * i] * p + q;
      lazyp[2 * i + 1] *= p;
      lazyq[2 * i + 1] = lazyq[2 * i + 1] * p + q;
    }
    return;
  }
  long long mid = (l + r) / 2;
  update(2 * i, l, mid, x, y, p, q);
  update(2 * i + 1, mid + 1, r, x, y, p, q);
  seg[i] = seg[2 * i] + seg[2 * i + 1];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  for (long long i = (long long)0; i < (long long)400005; i++)
    lazyp[i] = (double)1;
  cin >> n >> t;
  for (long long i = (long long)1; i < (long long)n + 1; i++) cin >> a[i];
  build(1, 1, n);
  while (t--) {
    cin >> g;
    if (g == 1) {
      cin >> l1 >> r1 >> l2 >> r2;
      p1 = (double)(r1 - l1) / (double)(r1 - l1 + 1);
      p2 = (double)(r2 - l2) / (double)(r2 - l2 + 1);
      q1 = query(1, 1, n, l2, r2) /
           ((double)(r1 - l1 + 1) * (double)(r2 - l2 + 1));
      q2 = query(1, 1, n, l1, r1) /
           ((double)(r1 - l1 + 1) * (double)(r2 - l2 + 1));
      update(1, 1, n, l1, r1, p1, q1);
      update(1, 1, n, l2, r2, p2, q2);
    } else {
      cin >> l1 >> r1;
      printf("%0.6lf\n", query(1, 1, n, l1, r1));
    }
  }
}
