#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long power(long long a, long long n) {
  a %= 1000000007;
  if (n == 1) return a;
  if (n == 0) return 1;
  if (n % 2)
    return (a * (power((a * a) % 1000000007, n / 2) % 1000000007)) % 1000000007;
  return power((a * a) % 1000000007, n / 2) % 1000000007;
}
const long long inf = (long long)1e18;
long long inverse(long long x) { return power(x, 1000000007 - 2) % 1000000007; }
long long n, q;
vector<double> v(200005);
double tree[4 * 200005];
pair<double, double> lazy[4 * 200005];
void build(long long no, long long st, long long la) {
  if (st == la) {
    tree[no] = v[st];
    lazy[no] = {1, 0};
    return;
  }
  long long mid = (st + la) / 2;
  build(2 * no, st, mid);
  build(2 * no + 1, mid + 1, la);
  tree[no] = tree[2 * no] + tree[2 * no + 1];
  lazy[no] = {1, 0};
}
void update(long long no, long long st, long long la, long long l, long long r,
            double prob, double extra) {
  tree[no] = lazy[no].first * tree[no] + lazy[no].second * (la - st + 1);
  if (st != la) {
    lazy[2 * no].first *= lazy[no].first,
        lazy[2 * no].second =
            lazy[2 * no].second * lazy[no].first + lazy[no].second;
    lazy[2 * no + 1].first *= lazy[no].first,
        lazy[2 * no + 1].second =
            lazy[2 * no + 1].second * lazy[no].first + lazy[no].second;
  }
  lazy[no] = {1, 0};
  if (l > la || r < st) return;
  if (l <= st && r >= la) {
    tree[no] = tree[no] * prob + extra * (la - st + 1);
    if (st != la) {
      lazy[2 * no].first *= prob,
          lazy[2 * no].second = lazy[2 * no].second * prob + extra;
      lazy[2 * no + 1].first *= prob,
          lazy[2 * no + 1].second = lazy[2 * no + 1].second * prob + extra;
    }
    return;
  }
  long long mid = (st + la) / 2;
  update(2 * no, st, mid, l, r, prob, extra);
  update(2 * no + 1, mid + 1, la, l, r, prob, extra);
  tree[no] = tree[2 * no] + tree[2 * no + 1];
}
double query(long long no, long long st, long long la, long long l,
             long long r) {
  tree[no] = lazy[no].first * tree[no] + lazy[no].second * (la - st + 1);
  if (st != la) {
    lazy[2 * no].first *= lazy[no].first,
        lazy[2 * no].second =
            lazy[2 * no].second * lazy[no].first + lazy[no].second;
    lazy[2 * no + 1].first *= lazy[no].first,
        lazy[2 * no + 1].second =
            lazy[2 * no + 1].second * lazy[no].first + lazy[no].second;
  }
  lazy[no] = {1, 0};
  if (l > la || r < st) return 0;
  if (l <= st && r >= la) return tree[no];
  long long mid = (st + la) / 2;
  return query(2 * no, st, mid, l, r) + query(2 * no + 1, mid + 1, la, l, r);
}
void solve() {
  cin >> n >> q;
  for (long long i = 1; i < n + 1; ++i) cin >> v[i];
  build(1, 1, n);
  while (q--) {
    long long type;
    cin >> type;
    if (type == 1) {
      double l1, r1, l2, r2;
      cin >> l1 >> r1 >> l2 >> r2;
      double prob1 = (r2 - l2) / (r2 - l2 + 1),
             extra1 = (query(1, 1, n, l1, r1) / (r1 - l1 + 1)) / (r2 - l2 + 1);
      double prob2 = (r1 - l1) / (r1 - l1 + 1),
             extra2 = (query(1, 1, n, l2, r2) / (r2 - l2 + 1)) / (r1 - l1 + 1);
      update(1, 1, n, l2, r2, prob1, extra1);
      update(1, 1, n, l1, r1, prob2, extra2);
    } else {
      long long l, r;
      cin >> l >> r;
      cout << fixed << setprecision(10) << query(1, 1, n, l, r) << "\n";
    }
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  long long T = 1;
  for (long long t = 1; t < T + 1; ++t) {
    solve();
  }
  return 0;
}
