#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long n, q, a[N];
double node[4 * N];
struct Lazy {
  double add, mul;
} lazy[4 * N];
void input() {
  scanf("%lld %lld", &n, &q);
  for (long long i = 1; i <= n; i++) scanf("%lld", &a[i]);
}
void init(long long i, long long l, long long r) {
  if (l > r) return;
  if (l == r) {
    node[i] = a[l] * 1.0;
    lazy[i].add = 0;
    lazy[i].mul = 1;
    return;
  }
  long long m = (l + r) >> 1;
  init(i << 1, l, m);
  init(i << 1 | 1, m + 1, r);
  node[i] = node[i << 1] + node[i << 1 | 1];
  lazy[i].add = 0;
  lazy[i].mul = 1;
}
void dolazy(long long i, long long l, long long r) {
  node[i] = node[i] * lazy[i].mul + lazy[i].add * (double)(r - l + 1);
  if (l != r) {
    lazy[i << 1].mul *= lazy[i].mul;
    lazy[i << 1 | 1].mul *= lazy[i].mul;
    lazy[i << 1].add = lazy[i << 1].add * lazy[i].mul + lazy[i].add;
    lazy[i << 1 | 1].add = lazy[i << 1 | 1].add * lazy[i].mul + lazy[i].add;
  }
  lazy[i].add = 0;
  lazy[i].mul = 1;
}
void update(long long i, long long l, long long r, long long a, long long b,
            double mul, double add) {
  dolazy(i, l, r);
  if (l > r || a > r || b < l) return;
  if (a <= l && r <= b) {
    node[i] = node[i] * mul + add * (double)(r - l + 1);
    if (l != r) {
      lazy[i << 1].add = lazy[i << 1].add * mul + add;
      lazy[i << 1 | 1].add = lazy[i << 1 | 1].add * mul + add;
      lazy[i << 1].mul *= mul;
      lazy[i << 1 | 1].mul *= mul;
    }
    return;
  }
  long long m = (l + r) >> 1;
  update(i << 1, l, m, a, b, mul, add);
  update(i << 1 | 1, m + 1, r, a, b, mul, add);
  node[i] = node[i << 1] + node[i << 1 | 1];
}
double get(long long i, long long l, long long r, long long a, long long b) {
  if (l > r || a > r || b < l) return 0;
  dolazy(i, l, r);
  if (a <= l && r <= b) return node[i];
  long long m = (l + r) >> 1;
  return get(i << 1, l, m, a, b) + get(i << 1 | 1, m + 1, r, a, b);
}
void solve() {
  while (q--) {
    long long type;
    scanf("%lld", &type);
    if (type == 1) {
      long long l1, r1, l2, r2;
      scanf("%lld %lld %lld %lld", &l1, &r1, &l2, &r2);
      double sum1 = get(1, 1, n, l1, r1);
      double sum2 = get(1, 1, n, l2, r2);
      sum1 = sum1 / (r1 - l1 + 1);
      sum2 = sum2 / (r2 - l2 + 1);
      update(1, 1, n, l1, r1, (double)(r1 - l1) / (double)(r1 - l1 + 1),
             sum2 / (double)(r1 - l1 + 1));
      update(1, 1, n, l2, r2, (double)(r2 - l2) / (double)(r2 - l2 + 1),
             sum1 / (double)(r2 - l2 + 1));
    } else {
      long long l, r;
      scanf("%lld %lld", &l, &r);
      printf("%.12f\n", get(1, 1, n, l, r));
    }
  }
}
signed main() {
  input();
  init(1, 1, n);
  solve();
  return 0;
}
