Mr. Kitayuta has just bought an undirected graph consisting of n vertices and m edges. The vertices of the graph are numbered from 1 to n. Each edge, namely edge i, has a color ci, connecting vertex ai and bi.

Mr. Kitayuta wants you to process the following q queries.

In the i-th query, he gives you two integers — ui and vi.

Find the number of the colors that satisfy the following condition: the edges of that color connect vertex ui and vertex vi directly or indirectly.

Input

The first line of the input contains space-separated two integers — n and m (2 ≤ n ≤ 100, 1 ≤ m ≤ 100), denoting the number of the vertices and the number of the edges, respectively.

The next m lines contain space-separated three integers — ai, bi (1 ≤ ai < bi ≤ n) and ci (1 ≤ ci ≤ m). Note that there can be multiple edges between two vertices. However, there are no multiple edges of the same color between two vertices, that is, if i ≠ j, (ai, bi, ci) ≠ (aj, bj, cj).

The next line contains a integer — q (1 ≤ q ≤ 100), denoting the number of the queries.

Then follows q lines, containing space-separated two integers — ui and vi (1 ≤ ui, vi ≤ n). It is guaranteed that ui ≠ vi.

Output

For each query, print the answer in a separate line.

Examples

Input

4 5
1 2 1
1 2 2
2 3 1
2 3 3
2 4 3
3
1 2
3 4
1 4


Output

2
1
0


Input

5 7
1 5 1
2 5 1
3 5 1
4 5 1
1 2 2
2 3 2
3 4 2
5
1 5
5 1
2 5
1 5
1 4


Output

1
1
1
1
2

Note

Let's consider the first sample. 

<image> The figure above shows the first sample. 

  * Vertex 1 and vertex 2 are connected by color 1 and 2. 
  * Vertex 3 and vertex 4 are connected by color 3. 
  * Vertex 1 and vertex 4 are not connected by any single color. 
2 1
1 2 1
1
1 2
 2 3
1 2 3
1 2 2
1 2 1
1
1 2
 2 5
1 2 1
1 2 2
1 2 3
1 2 4
1 2 5
1
1 2

1
 3
 5

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Aplain {

	public static void main(String[] args) throws IOException {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		String s = bf.readLine();
		String res = "NA";
		if (check(s)) {
			res = s.substring(0, 1 + (s.length() / 2));
			res += s.charAt(s.length() / 2);
			res += s.substring(1 + s.length() / 2, s.length());
		} else {
			for (int i = 0; i < s.length(); i++) {
				if (check(removeChar(s, i))) {
					int xx = i;
					int yy = (2 * (s.length() / 2) - i);
					if (s.length()%2!=0) {
						yy++;
					}
					if (i + 1 > (s.length() / 2)) {
						yy = i;
						xx = (s.length() - (i + 1)) % s.length();
						res = ""+s.charAt(i);
						res += s.substring(0, xx);
						res += s.substring(xx, yy);
						
						res += s.substring(yy, s.length());
					} else {
						
						res = s.substring(0, xx);
						res += s.substring(xx, yy);
						res += s.charAt(i);
						res += s.substring(yy, s.length());

					}

					break;

				}
			}
		}
		System.out.println(res);
	}

	public static String removeChar(String s, int i) {
		String res = s.substring(0, i);
		res += s.substring(i + 1, s.length());
		return res;
	}

	public static boolean check(String s) {
		String reversed = "";
		for (int i = s.length() - 1; i >= 0; i--) {
			reversed += s.charAt(i);

		}
		if (s.equals(reversed)) {
			return true;
		}
		return false;
	}

}
