Codeforces Round #316 (Div.2) C. Replacement

C. Replacement

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Daniel has a string s, consisting of lowercase English letters and period signs (characters '.'). Let's define the operation of replacement as the following sequence of steps: find a substring ".." (two consecutive periods) in string s, of all occurrences of the substring let's choose the first one, and replace this substring with string ".". In other words, during the replacement operation, the first two consecutive periods are replaced by one. If string s contains no two consecutive periods, then nothing happens.

Let's define f(s) as the minimum number of operations of replacement to perform, so that the string does not have any two consecutive periods left.

You need to process m queries, the i-th results in that the character at position xi (1 ≤ xi ≤ n) of string s is assigned value ci. After each operation you have to calculate and output the value of f(s).

Help Daniel to process all queries.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 300 000) the length of the string and the number of queries.

The second line contains string s, consisting of n lowercase English letters and period signs.

The following m lines contain the descriptions of queries. The i-th line contains integer xi and ci (1 ≤ xi ≤ n, ci — a lowercas English letter or a period sign), describing the query of assigning symbol ci to position xi.

Output

Print m numbers, one per line, the i-th of these numbers must be equal to the value of f(s) after performing the i-th assignment.

Examples

input

10 3
.b..bz....
1 h
3 c
9 f

output

4
3
1

input

4 4
.cc.
2 .
3 .
2 a
1 a

output

1
3
1
1

Note

Note to the first sample test (replaced periods are enclosed in square brackets).

The original string is ".b..bz....".

• after the first query f(hb..bz....) = 4    ("hb[..]bz...."  →  "hb.bz[..].."  →  "hb.bz[..]."  →  "hb.bz[..]"  → "hb.bz.")
• after the second query f(hbс.bz....) = 3    ("hbс.bz[..].."  →  "hbс.bz[..]."  →  "hbс.bz[..]"  →  "hbс.bz.")
• after the third query f(hbс.bz..f.) = 1    ("hbс.bz[..]f."  →  "hbс.bz.f.")

Note to the second sample test.

The original string is ".cc.".

• after the first query: f(..c.) = 1    ("[..]c."  →  ".c.")
• after the second query: f(....) = 3    ("[..].."  →  "[..]."  →  "[..]"  →  ".")
• after the third query: f(.a..) = 1    (".a[..]"  →  ".a.")
• after the fourth query: f(aa..) = 1    ("aa[..]"  →  "aa.")

大水题本来没什么好说的，时过半年偶然又看到记录一下。时间比较久远已经忘记曾经看过这题了，第一时间看错题意以为是将字符插入到该位置前，完全无视了replacement……莫名其妙看错题的情况下想出了办法。感觉插入的话还是挺有意思的，已经想到的方法里有将当前插入的各个点构造线段树，开始为空线段树，之后每次插入，将原字符串该位置直接改为'.'，线段树中该位置自增。每次插入时，插入位置减去线段树中从头开始到该位置的区域和。减去后比较该位置左边与本身是否为'.'，若是则相应增加，不是则修改线段树与原字符串后进入下一段插入。

和这题关系不大，没找到同类型的题也没码，不过就是个模板题，下面是这题代码。（过于暴力，没什么意义就不写题解了）

#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define INF 0x3f3f3f3
const int N=300005;
const int mod=1e9+7;

int s[N];

int main(){
    int n,m;
    string st;
    while (cin>>n>>m) {
        cin>>st;
        int x,sum=0;
        memset(s, 0, sizeof(s));
        for (int i=0; i<n; i++) {
            if (st[i]=='.') {
                s[i+1]=1;
                sum+=s[i];
            }
        }
        char temp;
        for (int i=0; i<m; i++) {
            cin>>x>>temp;
            if ((temp=='.'&&s[x]==1)||(temp!='.'&&s[x]==0)) {cout<<sum<<endl;continue;}
            if (temp=='.') {
                sum+=s[x-1]+s[x+1];
                s[x]=1;
            } else {
                s[x]=0;
                sum-=s[x-1]+s[x+1];
            }
            cout<<sum<<endl;
        }
    }
    return 0;
}