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.Scanner;
import java.util.TreeMap;

public class Main {

	public void solve() {
		Scanner scanner = new Scanner(System.in);
		int N = scanner.nextInt() + 1;
		int Q = scanner.nextInt();
		String string = scanner.next() + "z";
		int[] x = new int[Q];
		char[] c = new char[Q];
		for (int i = 0; i < Q; i++) {
			x[i] = scanner.nextInt() - 1;
			c[i] = scanner.next().toCharArray()[0];
		}
		scanner.close();

		// initialize
		TreeMap<Integer, Integer> treeMap = new TreeMap<>();
		treeMap.put(-1, 0);
		int sum = 0;
		int start = -1;
		for (int i = 0; i < N; i++) {
			if (string.charAt(i) == '.') {
				if (start == -1) {
					start = i;
				}
			} else {
				if (start != -1) {
					int num = i - start;
					treeMap.put(start, num);
					sum += num - 1;
					start = -1;
				}
			}
		}

		StringBuilder sb = new StringBuilder();
		for (int q = 0; q < Q; q++) {
			int begin = treeMap.lowerKey(x[q] + 1);// x[q]以下の始点
			int end = treeMap.get(begin) + begin - 1;
			if (end >= x[q]) {
				// ドット区間にぶつかる時
				if (c[q] != '.') {
					sum -= treeMap.get(begin) - 1;

					int next1 = x[q] - begin;
					int next2 = end - x[q];
					if (next1 == 0) {
						treeMap.remove(begin);
					} else {
						treeMap.put(begin, next1);
						sum += next1 - 1;
					}
					if (next2 != 0) {
						treeMap.put(x[q] + 1, next2);
						sum += next2 - 1;
					}
				}
			} else {
				if (c[q] == '.') {
					int num = 1;
					if (treeMap.containsKey(x[q] + 1)) {
						int sub = treeMap.get(x[q] + 1);
						num += sub;
						sum -= (sub - 1);
						treeMap.remove(x[q] + 1);
					}
					if (end + 1 == x[q]) {
						int sub = treeMap.get(begin);
						num += treeMap.get(begin);
						sum -= (sub - 1);
					} else {
						begin = x[q];
					}
					treeMap.put(begin, num);
					sum += num - 1;
				}

			}
			sb.append(sum);
			sb.append("\n");
		}
		System.out.print(sb.toString());

	}

	public static void main(String[] args) {
		new Main().solve();
	}

}