Problem: 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.")

Solution (in JAVA):

Solution:

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.StringTokenizer;


public class Main {

    
    private static boolean sameset(int a, int b, int[] uf) {
        
        return find(a,uf) == find(b,uf);
    }

    private static void union(int a, int b, int[] uf) {
        uf[find(a,uf)] = find(b,uf);
    }

    private static int find(int a, int[] uf) {
        if(a == uf[a])  return a;
        int root = find(uf[a],uf);
        uf[a] = root;
        return root;
    }

    private static void BFS(int i, int[][] G, int[][] path) {
       // System.out.println("source vertex "+i);
        int[] v = new int[G.length]; // current maximum dist in u---v path
        ArrayDeque<Integer> A = new ArrayDeque();
        A.add(i);
        while(A.isEmpty() == false){
            int u = A.pop();
            //System.out.println("for node "+u);
            for(int a=0;a<v.length;a++){
                if(G[u][a] > 0 && v[a]==0 && a!=i){//edge in MST, later make faster
                    //System.out.println(a+" is and edge from "+u);
                    if(G[u][a] > v[u]){
                        //System.out.println(" and it incrases the sub path max ");
                        v[a] = G[u][a];
                    }
                    else    v[a] = v[u];
                    path[i][a] = v[a];
                    path[a][i] = v[a];
                   // System.out.println("finally path from "+i+" to "+a+" is "+path[i][a]);
                    
                    A.add(a);
                }
            }
        }
    }

    private static int numd(int x) {
        Double xx = Double.parseDouble(String.valueOf(x));
        int y = (int) Math.log10(xx);
        return (y+1);
       
         
        
    }

    static class Node{
        
        int d=-1;
        long num;
        public Node(int a,long c){
            this.d = a;
            
            this.num = c;
            
        }
    }
    
    static class Edge{
        
        int x;
        int y;//ids of nodes
        int w;
        public Edge( int x1, int y1, int w){
            
            this.x = x1;
            this.y = y1;
            this.w = w;
        }
    }
   
    public static void main(String[] args) throws IOException {
        
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new PrintWriter(System.out));
        
        String[] _x = br.readLine().split(" ");
        int n = Integer.parseInt(_x[0]);
        int m = Integer.parseInt(_x[1]);
        
        char[] d = new char[n];
        String _y = br.readLine();
        for(int i=0;i<n;i++){
            d[i] = _y.charAt(i);
        }
        
        int state = 0; //not seen
        if(d[0]=='.')   state=1;//seen
        int cnt = 0;
        
        for(int i=1;i<n;i++){
            if(d[i]=='.' && state==1)   {
                //System.out.println("another");
                cnt+=1;
            }
            else if(d[i]!='.' && state==1)  state = 0;
            else if(d[i]=='.' && state==0)  state=1;
            else{
               // System.out.println("saw");
            }
        }
        //System.out.println(cnt);
        for(int i=0;i<m;i++){
//            if(i>=0){
//                for(int j=0;j<n;j++){
//                    System.out.print(d[j]);
//                }
//                System.out.println(i);
//                //System.exit(0);
//            }
            
            String[] _g= br.readLine().split(" ");
            int f = Integer.parseInt(String.valueOf(_g[0]));
            f-=1;
            char t= _g[1].charAt(0);
            int bf = d[f];
            d[f]=t;
            
            if(n==1)    System.out.println(0);
            else{
                if((bf=='.' && t=='.')||(bf!='.'&&t!='.'))  System.out.println(cnt);
                else if(bf=='.' && t!='.'){
            if ((f==0 && d[1]=='.') || (f==(n-1) && d[n-2]=='.')) cnt-=1;
            else if (f>0 && f<(n-1) && d[f-1]=='.' && d[f+1]=='.')cnt -=2;
            else if (f>0 && f<(n-1) && ((d[f-1]=='.' && d[f+1]!='.') || (d[f-1]!='.' && d[f+1]=='.'))) cnt-=1;
            System.out.println(cnt);
        }
        else if(bf!='.' && t=='.'){
            if ((f==0 && d[1]=='.') || (f==(n-1) && d[n-2]=='.')) cnt+=1;
            else if (f>0 && f<(n-1) && d[f-1]=='.' && d[f+1]=='.') cnt+=2;
            else if (f>0 && f<(n-1) && ((d[f-1]=='.' && d[f+1]!='.') || (d[f-1]!='.' && d[f+1]=='.'))) cnt+=1;
            System.out.println(cnt);
        }
            }
            
        }
       // System.out.println(cnt);
        bw.close();
    }

}