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.io.*;
public class Q1{
    public static void main(String[] args) throws Exception{
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        PrintWriter w=new PrintWriter(System.out);
        int i,j,k1,k2,n,m,q,c=0,temp;
        long sum=0;
        String s1[]=br.readLine().split(" ");
        n=Integer.parseInt(s1[0]);
        m=Integer.parseInt(s1[1]);
        q=Integer.parseInt(s1[2]);
        String s=br.readLine();
        String t=br.readLine();
        HashMap<Integer,Integer>hm=new HashMap<>();
        ArrayList<Integer>al=new ArrayList<>();
        int dp[]=new int[s.length()+1];
        for(i=0;i<=s.length()-t.length();i++){
            if(s.substring(i,i+t.length()).equals(t)) hm.put(i+1,i+t.length());
        }
        for(i=1;i<=s.length();i++){
            if(hm.containsKey(i)){
                dp[i]=dp[i-1]+1;
            }
            else dp[i]=dp[i-1];
        }
        for(i=0;i<q;i++){
            c=0;
            String ss[]=br.readLine().split(" ");
            k1=Integer.parseInt(ss[0]);
            k2=Integer.parseInt(ss[1]);
            if(k2-t.length()+1>=k1) c=dp[k2-t.length()+1]-dp[k1-1];
            al.add(c);
        }
        for(Integer r:al){
            System.out.println(r);
        }
    }
}