#include <bits/stdc++.h>
using namespace std;
double t[800000];
double add[800000];
double mult[800000];
int n, q;
int a[100000];
void push(int v, int tl, int tr) {
  t[v * 2] *= mult[v];
  t[v * 2 + 1] *= mult[v];
  mult[v * 2] *= mult[v];
  mult[v * 2 + 1] *= mult[v];
  add[v * 2] *= mult[v];
  add[v * 2 + 1] *= mult[v];
  mult[v] = 1;
  int tm = (tl + tr) / 2;
  t[v * 2] += (double)(tm - tl + 1) * add[v];
  t[v * 2 + 1] += (double)(tr - tm) * add[v];
  add[v * 2] += add[v];
  add[v * 2 + 1] += add[v];
  add[v] = 0;
  t[v] = t[v * 2] + t[v * 2 + 1];
}
void build(int v, int tl, int tr) {
  if (tl > tr) {
    return;
  }
  if (tl == tr) {
    t[v] = a[tl];
    return;
  }
  int tm = (tl + tr) / 2;
  build(v * 2, tl, tm);
  build(v * 2 + 1, tm + 1, tr);
  t[v] = t[v * 2] + t[v * 2 + 1];
}
void update(int v, int tl, int tr, int l, int r, double mult_val,
            double add_val) {
  if (l > r) return;
  if (tl == l && tr == r) {
    t[v] *= mult_val;
    t[v] += double(tr - tl + 1) * add_val;
    mult[v] *= mult_val;
    add[v] *= mult_val;
    add[v] += add_val;
    return;
  }
  push(v, tl, tr);
  int tm = (tl + tr) / 2;
  update(v * 2, tl, tm, l, min(tm, r), mult_val, add_val);
  update(v * 2 + 1, tm + 1, tr, max(tm + 1, l), r, mult_val, add_val);
  t[v] = t[2 * v] + t[2 * v + 1];
}
double sum(int v, int tl, int tr, int l, int r) {
  if (l > r) {
    return 0;
  }
  if (l == tl && r == tr) {
    return t[v];
  }
  push(v, tl, tr);
  int tm = (tl + tr) / 2;
  return sum(v * 2, tl, tm, l, min(r, tm)) +
         sum(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r);
}
int main() {
  for (int i = 0; i < 400000; i++) mult[i] = 1;
  scanf("%d %d", &n, &q);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  build(1, 0, n - 1);
  for (int i = 0; i < q; i++) {
    int type;
    scanf("%d", &type);
    if (type == 1) {
      int l1, r1, l2, r2;
      scanf("%d %d %d %d", &l1, &r1, &l2, &r2);
      l1--;
      r1--;
      l2--;
      r2--;
      double mean1 = sum(1, 0, n - 1, l1, r1) / (r1 - l1 + 1);
      double mean2 = sum(1, 0, n - 1, l2, r2) / (r2 - l2 + 1);
      double koef1 = (r1 - l1) / (r1 - l1 + 1.);
      double koef2 = (r2 - l2) / (r2 - l2 + 1.);
      double smallKoef1 = 1. / (r1 - l1 + 1);
      double smallKoef2 = 1. / (r2 - l2 + 1);
      update(1, 0, n - 1, l1, r1, koef1, smallKoef1 * mean2);
      update(1, 0, n - 1, l2, r2, koef2, smallKoef2 * mean1);
    } else {
      int l, r;
      scanf("%d %d", &l, &r);
      l--;
      r--;
      printf("%1.4lf\n", sum(1, 0, n - 1, l, r));
    }
  }
}
