MOD = 10**9 + 7

n = int(input())
q = int(input())

x = [0] * n
y = [0] * n

# Initialize b array
b = [0] * (n + 1)
b[0] = 1
for k in range(1, n + 1):
    b[k] = (y[k-1] * b[k-1] + 1) % MOD

for _ in range(q):
    parts = input().split()
    if parts[0] == 'x':
        i = int(parts[1])
        v = int(parts[2])
        x[i] = v
    elif parts[0] == 'y':
        i = int(parts[1])
        v = int(parts[2])
        y[i] = v
        # Recompute b from i+1 to n
        for k in range(i + 1, n + 1):
            prev = b[k-1]
            new_b = (y[k-1] * prev + 1) % MOD
            b[k] = new_b
    else:
        i = int(parts[1])
        total = 1  # a_0 is 1
        for k in range(i):
            total = (total + x[k] * (b[k] * b[k] % MOD)) % MOD
        print(total % MOD)