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.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Scanner;
import java.util.StringTokenizer;
 
public class temp {
	
	int lower(ArrayList<Integer> a,int x)
	{
		int l = 0,r = a.size()-1;
		int ans = -1;
		while(l<=r)
		{
			int mid = (l+r)/2;
			if(a.get(mid) >= x)
			{
				ans = mid;
				r = mid-1;
			}
			else
				l = mid+1;
		}
		return ans;
	}
	
	int upper(ArrayList<Integer> a,int x)
	{
		int l=0,r=a.size()-1;
		int ans = -1;
		
		while(l<=r)
		{
			int mid = (l+r)/2;
			if(a.get(mid) <= x)
			{
				ans = mid;
				l = mid+1;
			}
			else
				r = mid-1;
		}
		return ans;
	}
 
    void solve() throws IOException
    {
        FastReader sc=new FastReader();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int q = sc.nextInt();
        String s = sc.next();
        String p = sc.next();
        
        ArrayList<Integer> a = new ArrayList<>();
        
        for(int i=0;i<=s.length()-p.length();i++)
        {
        	String x = s.substring(i,i+p.length());
        	
        	if(x.equals(p))
        		a.add(i);
        }
        
        while(q-->0)
        {
        	int l = sc.nextInt()-1;
        	int r = sc.nextInt()-1;
        	
        	int idx1 = lower(a,l);
        	int idx2 = upper(a,r-p.length()+1);
        	
        	if(idx1!=-1 && idx2!=-1 && idx1 <= idx2)
        		System.out.println(idx2-idx1+1);
        	else
        		System.out.println("0");
        }
    }
    
    public static void main(String[] args) throws IOException {
        // TODO Auto-generated method stub
        new temp().solve();
 
    }
    
    class FastReader
    {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(new
                     InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt()
        {
            return Integer.parseInt(next());
        }
 
        long nextLong()
        {
            return Long.parseLong(next());
        }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
 
} 