1 #include <iostream>
  2 #include <cstdio>
  3 #include <cstring>
  4 using namespace std;
  5
  6 struct Matrix {
  7   int mat[2][2];
  8   Matrix() { memset(mat, 0, sizeof mat); }
  9 };
 10
 11 const int MaxN = 100000 + 5;
 12 const int Mod = 10007;
 13
 14 int N, M;
 15 Matrix One, Fibo, Zero;
 16 int L[MaxN * 4], R[MaxN * 4];
 17 Matrix Sum[MaxN * 4], Tag[MaxN * 4];
 18
 19 inline Matrix operator + (Matrix A, Matrix B) {
 20   Matrix C;
 21   for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j)
 22     C.mat[i][j] = (A.mat[i][j] + B.mat[i][j]) % Mod;
 23   return C;
 24 }
 25
 26 inline Matrix operator * (Matrix A, Matrix B) {
 27   Matrix C;
 28   for (int i = 0; i < 2; ++i) for (int j = 0; j < 2; ++j) {
 29     for (int k = 0; k < 2; ++k) C.mat[i][j] += A.mat[i][k] * B.mat[k][j] % Mod;
 30     C.mat[i][j] %= Mod;
 31   }
 32   return C;
 33 }
 34
 35 inline Matrix operator ^ (Matrix low, int high) {
 36   Matrix ans;
 37   ans.mat[0][0] = ans.mat[1][1] = 1;
 38   while (high) {
 39     if (high & 1) ans = ans * low;
 40     high >>= 1;
 41     low = low * low;
 42   }
 43   return ans;
 44 }
 45
 46 inline int read() {
 47   int x = 0; char c;
 48   do c = getchar(); while (c < '0' || c > '9');
 49   do x = (x << 1) + (x << 3) + c - '0', c = getchar(); while (c >= '0' && c <= '9');
 50   return x;
 51 }
 52
 53 inline void Push_up(int i) { Sum[i] = Sum[i << 1] + Sum[i << 1 | 1]; }
 54
 55 inline void Push_down(int i) {
 56   int lson = i << 1, rson = i << 1 | 1;
 57
 58   Tag[lson] = Tag[lson] * Tag[i];
 59   Sum[lson] = Sum[lson] * Tag[i];
 60   Tag[rson] = Tag[rson] * Tag[i];
 61   Sum[rson] = Sum[rson] * Tag[i];
 62   Tag[i] = One;
 63 }
 64
 65 void Build_Tree(int l, int r, int i) {
 66   L[i] = l, R[i] = r;
 67   Tag[i] = One;
 68   if (l == r) {
 69     Sum[i].mat[0][0] = Sum[i].mat[0][1] = 1;
 70     return;
 71   }
 72   int mid = L[i] + R[i] >> 1;
 73   Build_Tree(l, mid, i << 1);
 74   Build_Tree(mid + 1, r, i << 1 | 1);
 75   Push_up(i);
 76 }
 77
 78 void Update_Tree(int l, int r, int k, int i) {
 79   if (L[i] == l && R[i] == r) {
 80     Sum[i] = Sum[i] * (Fibo ^ k);
 81     Tag[i] = Tag[i] * (Fibo ^ k);
 82     return;
 83   }
 84   Push_down(i);
 85
 86   int mid = L[i] + R[i] >> 1;
 87   if (r <= mid) Update_Tree(l, r, k, i << 1);
 88   else if (l > mid) Update_Tree(l, r, k, i << 1 | 1);
 89   else {
 90     Update_Tree(l, mid, k, i << 1);
 91     Update_Tree(mid + 1, r, k, i << 1 | 1);
 92   }
 93   Push_up(i);
 94 }
 95
 96 Matrix Query_Tree(int l, int r, int i) {
 97   if (L[i] == l && R[i] == r)
 98     return Sum[i];
 99   Push_down(i);
100
101   int mid = L[i] + R[i] >> 1;
102   if (r <= mid) return Query_Tree(l, r, i << 1);
103   else if (l > mid) return Query_Tree(l, r, i << 1 | 1);
104   else {
105     Matrix lc = Query_Tree(l, mid, i << 1), rc = Query_Tree(mid + 1, r, i << 1 | 1);
106     return lc + rc;
107   }
108 }
109
110 int main() {
111   N = read(); M = read();
112   One.mat[0][0] = One.mat[1][1] = 1;
113   Fibo.mat[0][1] = Fibo.mat[1][0] = Fibo.mat[1][1] = 1;
114   Build_Tree(1, N, 1);
115
116   Matrix res;
117   for (int m = 1; m <= M; ++m) {
118     int l, r, k;
119     l = read(); r = read(); k = read();
120     if (k == 0) {
121       res = Query_Tree(l, r, 1);
122       printf("%d\n", res.mat[0][0]);
123     } else
124       Update_Tree(l, r, k, 1);
125   }
126
127   return 0;
128 }