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

public class Main {


	private static int[] arr;
	private static int[] root;
	private static int[] left;
	private static int[] right;

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		while (scanner.hasNext()) {
			int L = scanner.nextInt();
			int N = scanner.nextInt();
			int M = scanner.nextInt();
			String s = scanner.next();
			String t = scanner.next();
			arr = new int [s.length()+1];
			for(int i = 0; i < s.length() - t.length() + 1; i+= 0) {
				int index = s.substring(i).indexOf(t);
				if(index == -1) break;
				arr[index+1+i] = 1;
				i += index + 1;
			}
			root = new int [4*arr.length+10];
			left = new int [4*arr.length+10];
		    right = new int [4*arr.length+10];
			creat(1, 1, s.length());
			while (M -- > 0) {
				int a = scanner.nextInt();
				int b = scanner.nextInt();
				b = b - t.length() + 1;
				if (a > b) {
					System.out.println(0);
					continue;
				}
				System.out.println(select(1, a, b));
			}
		}
		
	}

	private static int select(int i, int a, int b) {
		// TODO Auto-generated method stub
		if(left[i] > b || right[i] < a)
			return 0;
		if(left[i] >= a && right[i] <= b)
			return root[i];
		return select(i<<1, a, b)+select(i<<1|1, a, b);
	}

	private static void creat(int i, int s, int e) {
		// TODO Auto-generated method stub
		left[i] = s;
		right[i] = e;
		if(s == e) {
			root[i] = arr[s];
			return;
		}
		int mid = (s+e)/2;
		creat(i<<1, s, mid);
		creat(i<<1|1, mid+1, e);
		root[i] = root[i<<1] + root[i<<1|1];
	}



}
