#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long poww(long long a, long long b) {
  if (b == 0) return 1;
  long long tmp = poww(a, b / 2);
  return (b & 1 ? a * tmp * tmp : tmp * tmp);
}
string itos(long long i) {
  string s = "";
  while (i) {
    s += char(i % 10 + '0');
    i /= 10;
  }
  reverse(s.begin(), s.end());
  return s;
}
long long stoi(string &s) {
  long long tot = 0;
  for (int i = (int)s.length() - 1, j = 1; i >= 0; i--, j *= 10) {
    tot += j * (s[i] + '0');
  }
  return tot;
}
int months[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
using namespace std;
long long mod = 1e9 + 7;
void tt() { freopen("test.txt", "r", stdin); }
const int MAX = 1e6 + 10;
double a[MAX];
double st[4 * MAX], lazy[4 * MAX], add[4 * MAX], mul[4 * MAX];
void build(int node, int se, int en) {
  if (se == en) {
    st[node] = a[se];
    mul[node] = 1;
    return;
  }
  int mi = (se + en) / 2;
  build(node * 2, se, mi);
  build(node * 2 + 1, mi + 1, en);
  st[node] = st[node * 2] + st[node * 2 + 1];
  mul[node] = 1;
}
void push(int node, int se, int en) {
  int mi = (se + en) / 2;
  st[node * 2] = mul[node] * st[node * 2] + (double)(mi - se + 1) * add[node];
  st[node * 2 + 1] =
      mul[node] * st[node * 2 + 1] + (double)(en - mi) * add[node];
  st[node] = st[node * 2] + st[node * 2 + 1];
  mul[node * 2] *= mul[node];
  mul[node * 2 + 1] *= mul[node];
  add[node * 2] *= mul[node];
  add[node * 2 + 1] *= mul[node];
  add[node * 2] += add[node];
  add[node * 2 + 1] += add[node];
  add[node] = 0;
  mul[node] = 1;
}
double get(int node, int se, int en, int l, int r) {
  if (l > en || r < se) {
    return 0;
  }
  if (l <= se && en <= r) {
    return st[node];
  }
  push(node, se, en);
  int mi = (se + en) / 2;
  double p1 = get(node * 2, se, mi, l, r);
  double p2 = get(node * 2 + 1, mi + 1, en, l, r);
  return (p1 + p2);
}
void update(int node, int se, int en, int l, int r, double tomul,
            double toadd) {
  if (l > en || r < se) {
    return;
  }
  if (l <= se && en <= r) {
    st[node] *= tomul;
    st[node] += double(en - se + 1) * toadd;
    mul[node] *= tomul;
    add[node] *= tomul;
    add[node] += toadd;
    return;
  }
  int mi = (se + en) / 2;
  push(node, se, en);
  update(node * 2, se, mi, l, r, tomul, toadd);
  update(node * 2 + 1, mi + 1, en, l, r, tomul, toadd);
  st[node] = st[node * 2] + st[node * 2 + 1];
}
int main() {
  int n, q;
  cin >> n >> q;
  for (int i = 1; i <= n; i++) cin >> a[i];
  build(1, 1, n);
  while (q--) {
    int type, l, r;
    cin >> type >> l >> r;
    if (type == 1) {
      int le, ri;
      cin >> le >> ri;
      double avg_val1 = get(1, 1, n, l, r) / double(r - l + 1);
      double avg_val2 = get(1, 1, n, le, ri) / double(ri - le + 1);
      update(1, 1, n, l, r, double(r - l) / double(r - l + 1),
             avg_val2 / double(r - l + 1));
      update(1, 1, n, le, ri, double(ri - le) / double(ri - le + 1),
             avg_val1 / double(ri - le + 1));
    } else
      cout << setprecision(10) << get(1, 1, n, l, r) << '\n';
  }
  return 0;
}
