You are given two strings s and t, both consisting only of lowercase Latin letters.

The substring s[l..r] is the string which is obtained by taking characters s_l, s_{l + 1}, ..., s_r without changing the order.

Each of the occurrences of string a in a string b is a position i (1 ≤ i ≤ |b| - |a| + 1) such that b[i..i + |a| - 1] = a (|a| is the length of string a).

You are asked q queries: for the i-th query you are required to calculate the number of occurrences of string t in a substring s[l_i..r_i].

Input

The first line contains three integer numbers n, m and q (1 ≤ n, m ≤ 10^3, 1 ≤ q ≤ 10^5) — the length of string s, the length of string t and the number of queries, respectively.

The second line is a string s (|s| = n), consisting only of lowercase Latin letters.

The third line is a string t (|t| = m), consisting only of lowercase Latin letters.

Each of the next q lines contains two integer numbers l_i and r_i (1 ≤ l_i ≤ r_i ≤ n) — the arguments for the i-th query.

Output

Print q lines — the i-th line should contain the answer to the i-th query, that is the number of occurrences of string t in a substring s[l_i..r_i].

Examples

Input

10 3 4
codeforces
for
1 3
3 10
5 6
5 7


Output

0
1
0
1


Input

15 2 3
abacabadabacaba
ba
1 15
3 4
2 14


Output

4
0
3


Input

3 5 2
aaa
baaab
1 3
1 1


Output

0
0

Note

In the first example the queries are substrings: "cod", "deforces", "fo" and "for", respectively.
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;


public class Abc {

	public static void main(String[] args) throws Exception {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer t=new StringTokenizer(br.readLine());
		int N=Integer.parseInt(t.nextToken());
		int M=Integer.parseInt(t.nextToken());
		int Q=Integer.parseInt(t.nextToken());
		String S=br.readLine();
		String T=br.readLine();
		
		ArrayList<Integer> A=new ArrayList<>();
		ArrayList<Integer> B=new ArrayList<>();
		int k=0;
		
		for(int i=0;i<(N-M+1);i++) {
			if(S.substring(i,i+M).equals(T)) {
				A.add(i+1);
				B.add(i+M);
			}
		}
		while(Q>0) {
			int cnt=0;
			t=new StringTokenizer(br.readLine());
			int L=Integer.parseInt(t.nextToken());
			int R=Integer.parseInt(t.nextToken());
			
			for(int i=0;i<A.size();i++) {
				if(L<=A.get(i)&&L<=B.get(i)&&R>=A.get(i)&&R>=B.get(i)) {
					cnt++;
				}
			}
			System.out.println(cnt);
			Q--;
		}
	}

}
