#include <bits/stdc++.h>
using std::lower_bound;
using std::map;
using std::queue;
using std::sort;
using std::string;
using std::upper_bound;
using std::vector;
template <class T>
class SegmentTree {
 public:
  T dat, lazym, lazyp;
  int leftBorder, rightBorder, mid;
  SegmentTree *leftSon, *rightSon;
  SegmentTree() {
    leftBorder = rightBorder = -1;
    leftSon = rightSon = NULL;
  }
  void pushdown();
  void pushup();
  void Build(T *, int, int);
  void Modify(int, int, T, T);
  T Query(int, int);
  void Free();
};
template <class T>
void SegmentTree<T>::pushdown() {
  if ((lazym != 1 || lazyp != (T)0) && leftBorder != rightBorder) {
    leftSon->dat = leftSon->dat * lazym +
                   lazyp * (leftSon->rightBorder - leftSon->leftBorder + 1);
    rightSon->dat = rightSon->dat * lazym +
                    lazyp * (rightSon->rightBorder - rightSon->leftBorder + 1);
    leftSon->lazym *= lazym;
    leftSon->lazyp = leftSon->lazyp * lazym + lazyp;
    rightSon->lazym *= lazym;
    rightSon->lazyp = rightSon->lazyp * lazym + lazyp;
  }
  lazym = (T)1;
  lazyp = (T)0;
}
template <class T>
void SegmentTree<T>::pushup() {
  dat = leftSon->dat + rightSon->dat;
}
template <class T>
void SegmentTree<T>::Build(T *S, int l, int r) {
  if (l > r) {
    return;
  }
  lazym = (T)1;
  lazyp = (T)0;
  leftBorder = l;
  rightBorder = r;
  mid = (leftBorder + rightBorder) >> 1;
  if (l == r) {
    dat = S[l];
    return;
  }
  leftSon = new SegmentTree;
  leftSon->Build(S, l, mid);
  rightSon = new SegmentTree;
  rightSon->Build(S, mid + 1, r);
  pushup();
}
template <class T>
void SegmentTree<T>::Modify(int l, int r, T mult, T plus) {
  if (l > r || l < leftBorder || rightBorder < r) {
    return;
  }
  if (leftBorder == l && rightBorder == r) {
    dat = dat * mult + plus * (rightBorder - leftBorder + 1);
    lazym *= mult;
    lazyp = lazyp * mult + plus;
    return;
  }
  pushdown();
  if (r <= mid) {
    leftSon->Modify(l, r, mult, plus);
  } else if (mid < l) {
    rightSon->Modify(l, r, mult, plus);
  } else {
    leftSon->Modify(l, mid, mult, plus);
    rightSon->Modify(mid + 1, r, mult, plus);
  }
  pushup();
}
template <class T>
T SegmentTree<T>::Query(int l, int r) {
  if (l > r || l < leftBorder || rightBorder < r) {
    return dat;
  }
  pushdown();
  if (l == leftBorder && r == rightBorder) {
    return dat;
  }
  if (r <= mid) {
    return leftSon->Query(l, r);
  } else if (mid < l) {
    return rightSon->Query(l, r);
  } else {
    return leftSon->Query(l, mid) + rightSon->Query(mid + 1, r);
  }
}
template <class T>
void SegmentTree<T>::Free() {
  if (leftSon != NULL) {
    leftSon->Free();
  }
  if (rightSon != NULL) {
    rightSon->Free();
  }
  delete leftSon;
  delete rightSon;
}
int cmp(const void *x, const void *y) {
  int dx = *((int *)(x)), dy = *((int *)(y));
  return dx > dy ? 1 : -1;
}
SegmentTree<double> st;
double a[100005];
int main() {
  int n, q;
  scanf("%d", &n);
  scanf("%d", &q);
  for (int i = 0; i < n; i++) scanf("%lf", &a[i]);
  st.Build(a, 0, n - 1);
  int t, l1, l2, l, r1, r2, r;
  for (int i = 0; i < q; i++) {
    scanf("%d", &t);
    if (t == 1) {
      scanf("%d", &l1);
      scanf("%d", &r1);
      scanf("%d", &l2);
      scanf("%d", &r2);
      l1--, r1--, l2--, r2--;
      double sum1 = st.Query(l1, r1), sum2 = st.Query(l2, r2);
      double ave1 = sum1 / (r1 - l1 + 1.0), ave2 = sum2 / (r2 - l2 + 1.0);
      st.Modify(l1, r1, (r1 - l1) / (r1 - l1 + 1.0), ave2 / (r1 - l1 + 1.0));
      st.Modify(l2, r2, (r2 - l2) / (r2 - l2 + 1.0), ave1 / (r2 - l2 + 1.0));
    } else {
      scanf("%d", &l);
      scanf("%d", &r);
      l--, r--;
      double ans = st.Query(l, r);
      printf("%.7lf\n", ans);
    }
  }
  return 0;
}
