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.*;
import java.util.regex.*;
import java.io.*;

public class Codeforces{
	
    public static void main(String[] args) throws IOException{
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		// BufferedReader br = new BufferedReader(new FileReader(new File("D:\\Shivang\\Java\\JavaFile.txt")));
		
		String[] s1 = input(br).split(" ");
		int n = Integer.parseInt(s1[0]);
		int m = Integer.parseInt(s1[1]);
		int q = Integer.parseInt(s1[2]);
		
		String sup = input(br);
		String sub = input(br);
		
		NavigableSet<Integer> start = new TreeSet<>();
		NavigableSet<Integer> end = new TreeSet<>();
		
		HashMap<Integer, Integer> startHashMap = new HashMap<>();
		HashMap<Integer, Integer> endHashMap = new HashMap<>();
		
		int curIndex = 0;
		
		for(int i = 0; i <= n - m; i++){
			if(sub.equals(sup.substring(i, i + m))){
				start.add(i + 1);
				end.add(i + m);
				
				startHashMap.put(i + 1, curIndex);
				endHashMap.put(i + m, curIndex);
				
				curIndex++;
			}
		}
		
		// System.out.println(start);
		// System.out.println(end);
		// System.out.println(startHashMap);
		// System.out.println(endHashMap);
		
		while(q-- > 0){
			String[] s2 = input(br).split(" ");
			int left = Integer.parseInt(s2[0]);
			int right = Integer.parseInt(s2[1]);
			
			int curStart = (start.ceiling(left) == null)? -1: start.ceiling(left);
			int curEnd = (end.floor(right) == null)? -1: end.floor(right);
			
			// System.out.println(curStart + " " + curEnd);
			
			if(curEnd == -1 || curStart == -1){
				System.out.println(0);
				continue;
			}
			
			int ansS = startHashMap.get(curStart);
			int ansE = endHashMap.get(curEnd);
			
			int finalAns = ansE - ansS + 1;
			
			if(finalAns < 0) finalAns = 0;
			
			System.out.println(finalAns);
		}
		
		br.close();
    }
	
	private static String input(BufferedReader br) throws IOException{
		// BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String line;
		while((line = br.readLine()) != null){
			if(line.trim().length() == 0) continue;
			
			return line;
		}
		return "";
	}
}