import std.conv, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } void chmin(T)(ref T t, in T f) { if (t > f) t = f; } void chmax(T)(ref T t, in T f) { if (t < f) t = f; } int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; } int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); } int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); } enum long[] P = [1000000007, 1000000009, 1000000021, 1000000033, 1000000087, 1000000093, 1000000097, 1000000103, 1000000123]; int N, Q; string[] T; int[] L, R; long[] K; void main() { auto BASE = new long[P.length]; BASE[0] = 314159265L; foreach (h; 1 .. P.length) { BASE[h] = (BASE[h - 1] * 123456789L) % 999999937L; } try { for (; ; ) { N = readInt(); Q = readInt(); T = new string[Q]; L = new int[Q]; R = new int[Q]; K = new long[Q]; foreach (q; 0 .. Q) { T[q] = readToken(); if (T[q] == "!") { L[q] = readInt(); R[q] = readInt(); K[q] = readInt(); } } auto a = new long[][](P.length, N); auto b = new long[][](P.length, N + 1); foreach (h; 0 .. P.length) { a[h][0] = 1; foreach (i; 1 .. N) { a[h][i] = (a[h][i - 1] * BASE[h]) % P[h]; } foreach (i; 0 .. N) { b[h][i + 1] = (b[h][i] + a[h][i]) % P[h]; } } auto hs = new long[][](Q + 1, P.length); int[][long] qs; qs[0] ~= 0; foreach (q; 0 .. Q) { switch (T[q]) { case "!": { foreach (h; 0 .. P.length) { hs[q + 1][h] = (hs[q][h] + (b[h][R[q]] - b[h][L[q]]) * K[q]) % P[h]; if (hs[q + 1][h] < 0) { hs[q + 1][h] += P[h]; } } qs[hs[q + 1][0]] ~= q + 1; } break; case "?": { int ans = -1; foreach (qq; qs[hs[q][0]]) { if (hs[qq] == hs[q]) { ans = qq; break; } } writeln(ans); hs[q + 1][] = hs[q][]; } break; default: assert(false); } debug { writeln(hs[q + 1]); } } } } catch (EOFException e) { } }