Black Debt

$n$ contestants take part in a programming competition. Before the competition, Mr. Malnar gave each contestant a shirt. Some contestants got yellow shirts and some got black shirts, which created a rivalry between the black team and the yellow team.

At the start of the competition every contestant has 0 points, and the color of each contestant's shirt is known. During the competition there are $q$ changes in the scores. In the $i$-th change, contestant $x_i$ has just received $d_i$ more points.

Each contestant in a yellow shirt computes their penalty (the so-called black debt) as the number of contestants in black shirts who at that moment have strictly more points than they do. After each change in the scores, compute and print the sum of the penalties of the contestants in yellow shirts.

The first line contains the positive integers $n$ ($1 \le n \le 10^5$) and $q$ ($1 \le q \le 3 \cdot 10^5$) from the problem statement.

The next line contains a string of $n$ characters describing the shirt color of each contestant. Each character in that string is one of the uppercase letters C or Z, denoting the shirt color of the $i$-th contestant (black or yellow). There will be at least one contestant with a black shirt and at least one contestant with a yellow shirt.

The following $q$ lines each contain two positive integers $x_i$ ($1 \le x_i \le n$) and $d_i$ ($1 \le d_i \le 3 \cdot 10^5$).

The maximum number of points a contestant can score in the competition is $3 \cdot 10^5$.

In the $i$-th of the $q$ lines of output, print the total black debt after the $i$-th change.