#include <bits/stdc++.h>
int inp() {
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  int sum = 0;
  while (c >= '0' && c <= '9') {
    sum = sum * 10 + c - '0';
    c = getchar();
  }
  return sum;
}
double a[100010];
struct SEG_Tree {
  struct SEG {
    int l;
    int r;
    double lazy2;
    double sum;
    double lazy;
  } t[800010];
  void push_down(int cur) {
    if (t[cur].lazy2 != 1) {
      t[((cur) << 1)].lazy2 *= t[cur].lazy2;
      t[((cur) << 1 | 1)].lazy2 *= t[cur].lazy2;
      t[((cur) << 1)].lazy *= t[cur].lazy2;
      t[((cur) << 1 | 1)].lazy *= t[cur].lazy2;
      t[((cur) << 1)].sum *= t[cur].lazy2;
      t[((cur) << 1 | 1)].sum *= t[cur].lazy2;
      t[cur].lazy2 = 1;
    }
    t[((cur) << 1)].sum +=
        t[cur].lazy * (double)(t[((cur) << 1)].r - t[((cur) << 1)].l + 1);
    t[((cur) << 1 | 1)].sum +=
        t[cur].lazy *
        (double)(t[((cur) << 1 | 1)].r - t[((cur) << 1 | 1)].l + 1);
    t[((cur) << 1)].lazy += t[cur].lazy;
    t[((cur) << 1 | 1)].lazy += t[cur].lazy;
    t[cur].lazy = 0;
  }
  void push_up(int cur) {
    t[cur].sum = t[((cur) << 1)].sum + t[((cur) << 1 | 1)].sum;
  }
  void build(int cur, int l, int r) {
    t[cur].l = l;
    t[cur].r = r;
    t[cur].lazy = 0;
    t[cur].lazy2 = 1;
    if (l == r) {
      t[cur].sum = a[l];
      return;
    }
    int mid = (l + r) >> 1;
    build(((cur) << 1), l, mid);
    build(((cur) << 1 | 1), mid + 1, r);
    push_up(cur);
  }
  void clear(int cur, int l, int r, double c) {
    if (t[cur].l > r || t[cur].r < l) return;
    push_down(cur);
    if (t[cur].l >= l && t[cur].r <= r) {
      t[cur].lazy2 *= c;
      t[cur].lazy *= c;
      t[cur].sum *= c;
      return;
    }
    clear(((cur) << 1), l, r, c);
    clear(((cur) << 1 | 1), l, r, c);
    push_up(cur);
  }
  void modify(int cur, int l, int r, double c) {
    if (t[cur].l > r || t[cur].r < l) return;
    push_down(cur);
    if (t[cur].l >= l && t[cur].r <= r) {
      t[cur].lazy += c;
      t[cur].sum += (double)(t[cur].r - t[cur].l + 1) * c;
      return;
    }
    modify(((cur) << 1), l, r, c);
    modify(((cur) << 1 | 1), l, r, c);
    push_up(cur);
  }
  double query(int cur, int l, int r) {
    if (t[cur].l > r || t[cur].r < l) return 0;
    push_down(cur);
    if (t[cur].l >= l && t[cur].r <= r) return t[cur].sum;
    return query(((cur) << 1), l, r) + query(((cur) << 1 | 1), l, r);
  }
} t;
int main() {
  int n = inp();
  int m = inp();
  for (int i = 1; i <= n; i++) a[i] = inp();
  t.build(1, 1, n);
  for (int i = 1; i <= m; i++) {
    int op = inp();
    if (op == 1) {
      int l1 = inp();
      int r1 = inp();
      int l2 = inp();
      int r2 = inp();
      double sum1 = t.query(1, l1, r1);
      double sum2 = t.query(1, l2, r2);
      sum1 /= (double)(r1 - l1 + 1);
      sum2 /= (double)(r2 - l2 + 1);
      t.clear(1, l1, r1, (double)(r1 - l1) / (double)(r1 - l1 + 1));
      t.modify(1, l1, r1, sum2 / (double)(r1 - l1 + 1));
      t.clear(1, l2, r2, (double)(r2 - l2) / (double)(r2 - l2 + 1));
      t.modify(1, l2, r2, sum1 / (double)(r2 - l2 + 1));
    } else {
      int l = inp();
      int r = inp();
      printf("%.7lf\n", t.query(1, l, r));
    }
  }
}
