Dark Alley

문제

One cold and foggy night, you walk down a shady alley. There should be a lamp every few metres but none of them seem to work, and in this night, not even the moon enlightens your path. Alone and in the dark, you wonder: "Even if there was a working lamp somewhere, how much would it lighten my way?". Now, back at home, you want to calculate this.

The alley can be modelled as a line with a length of $nn$ metres. The fog has a uniform density and reduces the light of a lamp by a factor of $1-p1-p$ every metre. The brightness at one point is the sum of the light that reaches this point from every lamp. You want to calculate this brightness at some points after placing some lamps.

입력

The input consists of:

• One line with two integers $nn$ and $qq$ and one real number $pp$ (), the length of the alley, the number of queries and the density of the fog. The density $pp$ of the fog will be given with at most $66$ digits behind the decimal point.
• $qq$ lines containing one of three query types:
  1. "+ b x" given two integers $bb$ and $xx$ ($1\le b\le {10}^{9}1\backslash leq\; b\; \backslash leq\; 10^9$ and $1\le x\le n1\backslash leq\; x\; \backslash leq\; n$), place a lamp with brightness $bb$ at position $xx$.
  2. "- b x" given integers $bb$ and $xx$ ($1\le b\le {10}^{9}1\backslash leq\; b\; \backslash leq\; 10^9$ and $1\le x\le n1\backslash leq\; x\; \backslash leq\; n$), remove a lamp with brightness $bb$ at position $xx$. It is guaranteed that a lamp with that brightness was placed there earlier.
  3. "? x" given one integer $xx$ ($1\le x\le n1\backslash leq\; x\; \backslash leq\; n$), calculate the brightness at position $xx$.

출력

It can be shown that the brightness can be calculated as a fraction $\frac{P}{Q}\backslash frac\{P\}\{Q\}$ where $QQ$ is not divisible by ${10}^9+710^9+7$. For each query of type "?", print the brightness as $P\cdot Q^{-1}{10}^9+7P\backslash cdot\; Q^\{-1\}\; \backslash bmod\; 10^9+7$ in a single line.