#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

const int C = 31, C2 = 29, P = 1000000007, P2 = 1000000009;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N, Q;
    cin >> N >> Q;

    vll c1(N+1);
    c1[1] = 1;
    rep(i, N - 1) {
        c1[i+2] = c1[i+1] * C%P;
    }
    rep(i, N) {
        (c1[i + 1] += c1[i]) %= P;
    }

    unordered_map<ll, int> aa;
    ll x = 0;
    rep(i, Q) {
        if(!aa.count(x)) {
            aa[x] = i;
        }

        char c; cin >> c;
        if(c == '!') {
            int l, r, y;
            cin >> l >> r >> y;
            ll z1 = (c1[r] - c1[l])*y;
            (x += z1)%=P;
            if(x < 0)x += P;
        } else {
            cout << aa[x] << endl;
        }
    }
}