#include <bits/stdc++.h>
using namespace std;
inline int in() {
  int32_t x;
  scanf("%d", &x);
  return x;
}
inline long long lin() {
  long long x;
  scanf("%lld", &x);
  return x;
}
inline string get() {
  char ch[2000010];
  scanf("%s", ch);
  return ch;
}
inline void read(int *a, int n) {
  for (int i = 0; i < n; i++) a[i] = in();
}
template <class blank>
inline void out(blank x) {
  cout << x << "\n";
  exit(0);
}
const int maxn = 1e5 + 10;
const int maxm = 1e6 + 10;
const int maxlg = 21;
const int base = 29;
const int mod = 1e9 + 7;
const long long INF = 1e18 + 10;
const int SQ = 317 + 5;
int n, q, a[maxn];
struct matrix {
  int a[2][2];
  matrix(int v = 0) {
    for (int i = 0; i < 2; i++)
      for (int j = 0; j < 2; j++) a[i][j] = (i == j ? v : 0);
  }
  inline int *operator[](int x) { return a[x]; }
};
inline int rel(int x) {
  if (x >= mod) return x - mod;
  return x;
}
inline matrix operator*(matrix &a, matrix &b) {
  matrix ret;
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < 2; j++)
      for (int k = 0; k < 2; k++)
        ret.a[i][j] = rel(ret.a[i][j] + 1LL * a[i][k] * b[k][j] % mod);
  return ret;
}
inline matrix operator^(matrix a, int tm) {
  matrix ret(1);
  while (tm) {
    if (tm % 2) ret = ret * a;
    a = a * a;
    tm /= 2;
  }
  return ret;
}
struct node {
  matrix a;
  matrix lazy;
  node() {
    lazy = matrix(1);
    a[0][0] = a[0][1] = 1;
  }
} stree[4 * maxn];
matrix pw;
matrix zarib;
inline void merge(int p) {
  stree[p].a[0][0] = rel(stree[2 * p + 1].a[0][0] + stree[2 * p + 2].a[0][0]);
  stree[p].a[0][1] = rel(stree[2 * p + 1].a[0][1] + stree[2 * p + 2].a[0][1]);
}
inline void build(int p = 0, int l = 0, int r = n - 1) {
  if (l == r) {
    zarib = pw ^ (a[l] - 1);
    stree[p].a = stree[p].a * zarib;
    return;
  }
  int mid = (l + r) >> 1;
  build(2 * p + 1, l, mid);
  build(2 * p + 2, mid + 1, r);
  merge(p);
}
inline void shift(int p) {
  stree[2 * p + 1].lazy = stree[2 * p + 1].lazy * stree[p].lazy;
  stree[2 * p + 2].lazy = stree[2 * p + 2].lazy * stree[p].lazy;
  stree[2 * p + 2].a = stree[2 * p + 2].a * stree[p].lazy;
  stree[2 * p + 1].a = stree[2 * p + 1].a * stree[p].lazy;
  stree[p].lazy = matrix(1);
}
inline void update(int ql, int qr, int p = 0, int l = 0, int r = n - 1) {
  if (l > qr || r < ql) return;
  if (l >= ql && r <= qr) {
    stree[p].lazy = stree[p].lazy * zarib;
    stree[p].a = stree[p].a * zarib;
    return;
  }
  shift(p);
  int mid = (l + r) >> 1;
  update(ql, qr, 2 * p + 1, l, mid);
  update(ql, qr, 2 * p + 2, mid + 1, r);
  merge(p);
}
inline int get(int ql, int qr, int p = 0, int l = 0, int r = n - 1) {
  if (l > qr || r < ql) return 0;
  if (l >= ql && r <= qr) return stree[p].a[0][0];
  shift(p);
  int mid = (l + r) >> 1;
  return (get(ql, qr, 2 * p + 1, l, mid) + get(ql, qr, 2 * p + 2, mid + 1, r)) %
         mod;
}
int32_t main() {
  n = in(), q = in();
  pw[0][1] = pw[1][0] = pw[1][1] = 1;
  read(a, n);
  build();
  while (q--) {
    int tp = in();
    if (tp == 1) {
      int l = in() - 1, r = in() - 1, val = in();
      zarib = pw ^ val;
      update(l, r);
    } else {
      int l = in() - 1, r = in() - 1;
      printf("%d\n", get(l, r));
    }
  }
}
