#include <bits/stdc++.h>
using namespace std;
typedef struct seg_node {
  double sum = 0;
  double add = 0;
  double mul = 1.0;
} sn;
sn merge(sn a, sn b) {
  sn tmp;
  tmp.sum = a.sum + b.sum;
  return tmp;
}
long long n, q;
class lazy_segment_tree {
 private:
  vector<sn> tree;
  vector<double> a;

 public:
  lazy_segment_tree(long long n) {
    tree.resize(4 * n);
    a.resize(n, 0);
  }
  lazy_segment_tree(vector<double> &v) {
    a = v;
    n = v.size();
    tree.resize(4 * v.size());
  }
  void lazy_update(long long x, long long second, long long ee) {
    if (tree[x].add == 0 && tree[x].mul == 1) return;
    tree[x].sum *= tree[x].mul;
    tree[x].sum += tree[x].add * (ee - second + 1);
    if (second != ee) {
      tree[2 * x].mul *= tree[x].mul;
      tree[2 * x].add *= tree[x].mul;
      tree[2 * x].add += tree[x].add;
      tree[2 * x + 1].mul *= tree[x].mul;
      tree[2 * x + 1].add *= tree[x].mul;
      tree[2 * x + 1].add += tree[x].add;
    }
    tree[x].add = 0;
    tree[x].mul = 1.0;
  }
  void built(long long x = 1, long long second = 0, long long ee = n - 1) {
    if (second == ee) {
      tree[x].sum = a[second];
      return;
    }
    long long m = (second + ee) / 2;
    built(2 * x, second, m);
    built(2 * x + 1, m + 1, ee);
    tree[x] = merge(tree[2 * x], tree[2 * x + 1]);
  }
  void update(long long l, long long r, double add, double mul, long long x = 1,
              long long second = 0, long long ee = n - 1) {
    lazy_update(x, second, ee);
    if (second > r || ee < l || l > r) return;
    if (second >= l && ee <= r) {
      tree[x].mul *= mul;
      tree[x].add *= mul;
      tree[x].add += add;
      lazy_update(x, second, ee);
      return;
    }
    long long m = (second + ee) / 2;
    update(l, r, add, mul, 2 * x, second, m);
    update(l, r, add, mul, 2 * x + 1, m + 1, ee);
    tree[x] = merge(tree[2 * x], tree[2 * x + 1]);
  }
  sn query(long long l, long long r, long long x = 1, long long second = 0,
           long long ee = n - 1) {
    lazy_update(x, second, ee);
    if (second > r || ee < l || l > r) return tree[0];
    if (second >= l && ee <= r) return tree[x];
    long long m = (second + ee) / 2;
    sn p = query(l, r, 2 * x, second, m);
    sn q = query(l, r, 2 * x + 1, m + 1, ee);
    sn ans = merge(p, q);
    return ans;
  }
};
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << setprecision(20) << fixed;
  cin >> n >> q;
  vector<double> a(n);
  for (auto &i : a) cin >> i;
  lazy_segment_tree lst(a);
  lst.built();
  while (q--) {
    long long type;
    cin >> type;
    if (type == 1) {
      long long l1, l2, r1, r2;
      cin >> l1 >> r1 >> l2 >> r2;
      l1--, r1--, l2--, r2--;
      double exp1 = lst.query(l1, r1).sum;
      double exp2 = lst.query(l2, r2).sum;
      exp1 /= (r1 - l1 + 1) * (r2 - l2 + 1);
      exp2 /= (r2 - l2 + 1) * (r1 - l1 + 1);
      double m = (r1 - l1) * 1.0 / (r1 - l1 + 1);
      lst.update(l1, r1, exp2, m);
      m = (r2 - l2) * 1.0 / (r2 - l2 + 1);
      lst.update(l2, r2, exp1, m);
    } else {
      long long l, r;
      cin >> l >> r;
      l--, r--;
      double ans = lst.query(l, r).sum;
      cout << ans << '\n';
    }
  }
}
