Ground Defense

You are a denizen of Linetopia, whose $n$ major cities are equally spaced along an east-west line. They are numbered in order from $1$ to $n$, where $1$ is the westmost city and $n$ is the eastmost city. Linetopia was a lovely place to live until forces from neighboring Trapez invaded. As part of Linetopia's citizen protection initiative, you have been asked to process information about Trapezoid troop movements, so that the government can determine which cities have been hit hardest and where to send reinforcements.

Linetopia intelligence has discovered that the Trapezoid forces attack in the following pattern. They send massive aircraft to drop troops on Linetopia's cities. Each aircraft starts at some city $i$ and drops $s$ soldiers there. The aircraft then flies either east or west. Each time it flies over another city, it drops $a$ more soldiers than it dropped on the previous city it passed. After performing $d$ drops, the aircraft returns to Trapez to resupply.

You receive intel updates that give the specs of each Trapezoid aircraft passing over Linetopia. You must also answer queries that ask how many Trapezoid troops have been dropped on a particular city so far.

The first line contains a single integer $T$ ($1 \le T \le 10$), the number of test cases. The first line of each test case contains two integers: $m$ ($1 \le m \le 10\,000$), the total number of updates and queries, and $n$ ($1 \le n \le 500\,000$), the number of cities in Linetopia.

Each of the next $m$ lines is either an update or a query. An update line begins with a capital U, followed by a capital E (east) or W (west) that gives the direction, followed by four integers $i$ ($1 \le i \le n$), $s$ ($1 \le s \le 10\,000$), $a$ ($0 \le a \le 10\,000$), and $d$ ($1 \le d \le n$). These are the starting city, the number of soldiers in the first drop, the increase in soldiers per city, and the number of drops, respectively. An aircraft never flies west of city $1$ or east of city $n$ during its $d$ drops.

A query line begins with a capital Q, followed by a single integer $i$ ($1 \le i \le n$), the city being queried.

For each query, in input order, print one line with the number of Trapezoid troops dropped on that city up to that point.

In the sample, two aircraft fly over Linetopia. The first starts at city $1$ and heads east. It drops $5$ soldiers on city $1$, $7$ soldiers on city $2$, and $9$ soldiers on city $3$. The second starts at city $3$ and flies west. It drops $10$ soldiers on city $3$ and $20$ soldiers on city $2$.