#include <bits/stdc++.h>
using namespace std;
struct {
  long double sum, lazy_prod, lazy_sum;
} tree[100005 * 4];
int a[100005];
void update_node(int idx, int b, int e, long double prod, long double sum) {
  tree[idx].sum = prod * tree[idx].sum + sum * (long double)(e - b + 1);
  tree[idx].lazy_prod *= prod;
  tree[idx].lazy_sum = tree[idx].lazy_sum * prod + sum;
}
void update_lazy(int idx, int b, int e) {
  update_node((idx * 2), (b), ((b + e) / 2), tree[idx].lazy_prod,
              tree[idx].lazy_sum);
  update_node((idx * 2 + 1), ((b + e) / 2 + 1), (e), tree[idx].lazy_prod,
              tree[idx].lazy_sum);
  tree[idx].lazy_prod = 1.0;
  tree[idx].lazy_sum = 0.0;
}
void init(int idx, int b, int e) {
  if (b == e) {
    tree[idx].lazy_prod = 1.0;
    tree[idx].sum = a[b];
    return;
  }
  init((idx * 2), (b), ((b + e) / 2));
  init((idx * 2 + 1), ((b + e) / 2 + 1), (e));
  tree[idx].sum = tree[idx * 2].sum + tree[(idx * 2) + 1].sum;
  tree[idx].lazy_prod = 1.0;
}
void update(int idx, int b, int e, int &st, int &en, long double &prod,
            long double &sum) {
  if (st > e || en < b) return;
  if (st <= b && e <= en) {
    update_node(idx, b, e, prod, sum);
    return;
  }
  update_lazy(idx, b, e);
  update((idx * 2), (b), ((b + e) / 2), st, en, prod, sum);
  update((idx * 2 + 1), ((b + e) / 2 + 1), (e), st, en, prod, sum);
  tree[idx].sum = tree[idx * 2].sum + tree[(idx * 2) + 1].sum;
}
long double query(int idx, int b, int e, int &st, int &en) {
  if (st > e || en < b) return 0.0;
  if (st <= b && e <= en) return tree[idx].sum;
  update_lazy(idx, b, e);
  return query((idx * 2), (b), ((b + e) / 2), st, en) +
         query((idx * 2 + 1), ((b + e) / 2 + 1), (e), st, en);
}
int main() {
  int n, i, q, k, l1, l2, r1, r2;
  long double sum1, sum2, prod, sum;
  scanf("%d %d", &n, &q);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  init(1, 1, n);
  while (q--) {
    scanf("%d", &k);
    if (k == 1) {
      scanf("%d %d %d %d", &l1, &r1, &l2, &r2);
      sum1 = query(1, 1, n, l1, r1);
      sum2 = query(1, 1, n, l2, r2);
      prod = ((long double)(r1 - l1)) / ((long double)(r1 - l1 + 1));
      sum = (1.0 / ((long double)(r1 - l1 + 1))) *
            (1.0 / ((long double)(r2 - l2 + 1))) * sum2;
      update(1, 1, n, l1, r1, prod, sum);
      prod = ((long double)(r2 - l2)) / ((long double)(r2 - l2 + 1));
      sum = (1.0 / ((long double)(r1 - l1 + 1))) *
            (1.0 / ((long double)(r2 - l2 + 1))) * sum1;
      update(1, 1, n, l2, r2, prod, sum);
    } else {
      scanf("%d %d", &l1, &r1);
      printf("%0.6Lf\n", query(1, 1, n, l1, r1));
    }
  }
  return 0;
}
