#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;

const int Q = 100199;
int t[Q];
int l[Q], r[Q];
ll k[Q];

ll powmod(ll x, ll e, ll mod) {
  ll sum = 1 % mod;
  ll cur = x % mod;
  while (e > 0) {
    if (e % 2 == 1) {
      sum = sum * cur % mod;
    }
    cur = cur * cur % mod;
    e /= 2;
  }
  return sum;
}

ll calc(int left, int rr, ll b, ll mod) {
  // TODO naive
  // (b^r-b^l) / (b-1)
  ll sum = powmod(b, rr, mod) - powmod(b, left, mod) + mod;
  sum %= mod;
  sum *= powmod(b, mod - 2, mod);
  sum %= mod;
  return sum;
}

int main(void){
  int n, q;
  cin >> n >> q;
  ll mods[] = {1000000007, 1000000009};
  int nm = sizeof(mods) / sizeof(mods[0]);
  vector<VL> hash(q + 1, VL(nm, 0));
  map<VL, int> res;
  res[hash[0]] = 0;
  REP(i, 0, q) {
    char tt;
    cin >> tt;
    if (tt == '?') {
      t[i] = 1;
      REP(j, 0, nm) {
	hash[i + 1][j] = hash[i][j];
      }
    } else {
      t[i] = 0;
      cin >> l[i] >> r[i] >> k[i];
      REP(j, 0, nm) {
	ll h = calc(l[i], r[i], 457, mods[j]);
	h *= mods[j] + k[i];
	h %= mods[j];
	hash[i + 1][j] = (hash[i][j] + h) % mods[j];
      }
    }
    if (res.count(hash[i + 1]) == 0) {
      res[hash[i + 1]] = i + 1;
    }
    if (tt == '?') {
      cout << res[hash[i + 1]] << endl;
    }
  }
}