#include <bits/stdc++.h>
using namespace std;
const int tope = 1 << 18;
const int primero = 1 << 17;
double suma[tope];
double anyade[tope];
double multiplica[tope];
int posle[tope];
int posri[tope];
double getvalue(int pos) {
  return suma[pos] * multiplica[pos] +
         anyade[pos] * (posri[pos] - posle[pos] + 1);
}
void opera(double &mul, double &su, double newmul, double newsu) {
  mul *= newmul;
  su = (su * newmul + newsu);
}
void propaga(int pos) {
  if (primero <= pos) return;
  opera(multiplica[2 * pos], anyade[2 * pos], multiplica[pos], anyade[pos]);
  opera(multiplica[2 * pos + 1], anyade[2 * pos + 1], multiplica[pos],
        anyade[pos]);
  multiplica[pos] = 1;
  anyade[pos] = 0;
  suma[pos] = getvalue(2 * pos) + getvalue(2 * pos + 1);
}
void anyadeentre(int pos, int pos0, int pos1, double su, double pro) {
  if (posri[pos] < pos0 or pos1 < posle[pos]) return;
  if (pos0 <= posle[pos] and posri[pos] <= pos1) {
    opera(multiplica[pos], anyade[pos], pro, su);
    return;
  }
  propaga(pos);
  anyadeentre(2 * pos, pos0, pos1, su, pro);
  anyadeentre(2 * pos + 1, pos0, pos1, su, pro);
  suma[pos] = getvalue(2 * pos) + getvalue(2 * pos + 1);
}
double computaentre(int pos, int pos0, int pos1) {
  if (posri[pos] < pos0 or pos1 < posle[pos]) return 0;
  if (pos0 <= posle[pos] and posri[pos] <= pos1) return getvalue(pos);
  propaga(pos);
  return computaentre(2 * pos, pos0, pos1) +
         computaentre(2 * pos + 1, pos0, pos1);
}
const int limite = 1000000;
int n, casos;
double a[limite];
double getavg(int l, int r) { return computaentre(1, l, r) / (r - l + 1); }
void add(int l, int r, double x) { anyadeentre(1, l, r, x, 1); }
void multiply(int l, int r, double x) { anyadeentre(1, l, r, 0, x); }
int main() {
  ios::sync_with_stdio(false);
  cout.setf(ios::fixed);
  cout.precision(12);
  for (int i = tope - 1; i >= 1; i--) {
    if (primero <= i)
      posle[i] = posri[i] = i - primero;
    else {
      posle[i] = posle[2 * i];
      posri[i] = posri[2 * i + 1];
    }
  }
  cin >> n >> casos;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    anyadeentre(1, i, i, a[i], 1);
  }
  for (int cas = 0; cas < casos; cas++) {
    int tipo;
    cin >> tipo;
    if (tipo == 1) {
      int l1, r1, l2, r2;
      cin >> l1 >> r1 >> l2 >> r2;
      double s1 = r1 - l1 + 1;
      double s2 = r2 - l2 + 1;
      double avg1 = getavg(l1, r1);
      double avg2 = getavg(l2, r2);
      multiply(l1, r1, (s1 - 1) / s1);
      add(l1, r1, avg2 / s1);
      multiply(l2, r2, (s2 - 1) / s2);
      add(l2, r2, avg1 / s2);
    } else {
      int l, r;
      cin >> l >> r;
      double s = r - l + 1;
      double avg = getavg(l, r);
      cout << s * avg << endl;
    }
  }
}
