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.util.*;
import java.util.Map.Entry;
import java.io.*;
import java.lang.*;
import java.math.*;

import static java.lang.Math.*;

public class Solution implements Runnable {
	
	class Segment implements Comparable<Segment> {
		int lf, rg;
		
		Segment(int lf, int rg) {
			this.lf = lf;
			this.rg = rg;
		}
		
		public int compareTo(Segment s) {
			if (lf != s.lf) {
				return lf < s.lf ? -1 : 1;
			}
			if (rg != s.rg) {
				return rg < s.rg ? -1 : 1;
			}
			return 0;
		}
	}
	
    void solve() throws Exception {
    	int n = sc.nextInt();
    	int q = sc.nextInt();
    	String s = sc.nextToken();
    	TreeSet<Segment> st = new TreeSet<Segment>();
    	int ans = 0;
    	for (int i = 0; i < s.length(); i++) {
    		if (s.charAt(i) == '.') {
    			int j = i + 1;
    			while (j < n && s.charAt(j) == '.') j++;
    			st.add(new Segment(i, j - 1));
    			ans += j - i - 1;
    			i = j;
    		}
    	}
    	st.add(new Segment(-3, -3));
    	st.add(new Segment(n + 2, n + 2));
    	while (q-- > 0) {
    		int pos = sc.nextInt() - 1;
    		if (sc.nextToken().equals(".")) {
    			Segment sl = st.floor(new Segment(pos, n));
    			Segment sr = st.ceiling(new Segment(pos, 0));
    			if (sl.rg + 1 == pos || sr.lf - 1 == pos) {
    				if (sl.rg + 1 == pos && sr.lf - 1 == pos) {
	    				st.remove(sl);
	    				st.remove(sr);
	    				ans -= sl.rg - sl.lf;
	    				ans -= sr.rg - sr.lf;
	    				st.add(new Segment(sl.lf, sr.rg));
	    				ans += sr.rg - sl.lf;
    				} else {
    					if (sl.rg + 1 == pos) {
    						st.remove(sl);
    						ans -= sl.rg - sl.lf;
    						st.add(new Segment(sl.lf, pos));
    						ans += pos - sl.lf;
    					} else {
    						st.remove(sr);
    						ans -= sr.rg - sr.lf;
    						st.add(new Segment(pos, sr.rg));
    						ans += sr.rg - pos;
    					}
    				}
    			} else if (sl.rg < pos && pos < sr.lf) {
    				st.add(new Segment(pos, pos));
    			}
    		} else {
    			Segment se = st.floor(new Segment(pos, n));
    			if (se.lf <= pos && pos <= se.rg) {
    				st.remove(se);
    				ans -= se.rg - se.lf;
    				if (se.lf < pos) {
    					st.add(new Segment(se.lf, pos - 1));
    					ans += pos - 1 - se.lf;
    				}
    				if (pos < se.rg) {
    					st.add(new Segment(pos + 1, se.rg));
    					ans += se.rg - pos - 1;
    				}
    			}
    		}
    		out.println(ans);
    	}
    }
    
    BufferedReader in;
    PrintWriter out;
    FastScanner sc;
    
    final String INPUT_FILE = "stdin";
    final String OUTPUT_FILE = "stdout";
    
    static Throwable throwable;
    
    public static void main(String[] args) throws Throwable {
        Thread thread = new Thread(null, new Solution(), "", (1 << 26));
        thread.start();
        thread.join();
        thread.run();
        if (throwable != null)
            throw throwable;
    }
    
    
    public void run() {
        try {
            if (INPUT_FILE.equals("stdin"))
                in = new BufferedReader(new InputStreamReader(System.in));
            else
                in = new BufferedReader(new FileReader(INPUT_FILE));
            if (OUTPUT_FILE.equals("stdout"))
                out = new PrintWriter(System.out);
            else
                out = new PrintWriter(new FileWriter(OUTPUT_FILE));
            sc = new FastScanner(in);
            solve();
        } catch (Exception e) {
            throwable = e;
        } finally {
            out.close();
        }
    }
}

class FastScanner {
    BufferedReader reader;
    StringTokenizer strTok;
    
    FastScanner(BufferedReader reader) {
        this.reader = reader;
    }
    
    public String nextToken() throws Exception {
        while (strTok == null || !strTok.hasMoreTokens())
            strTok = new StringTokenizer(reader.readLine());
        return strTok.nextToken();
    }
    
    public boolean EOF() throws Exception {
    	if (strTok != null && strTok.hasMoreTokens()) {
    		return false;
    	} else {
    		String line = reader.readLine();
    		if (line == null)
    			return true;
    		strTok = new StringTokenizer(line);
    		return false;
    	}
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}