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.*;

public class test
{	
	/*
	private static class IntegerPair implements Comparable
	{
	    public Integer first;
	    public Integer second;

	    public IntegerPair(Integer f, Integer s) {
			first = f;
			second = s;
	    }

		public int compareTo(Object obj) 
		{
			if (!this.first.equals( ((IntegerPair)obj).first) )
			{
			    return first - ((IntegerPair)obj).first;
			}
			else
			{
			    return second - ((IntegerPair)obj).second;
			}
		}
	}
	*/
	
	/*
	//Arrays.sort(data, new MyComparator());
	//if a<b return -1
	//if a>b return 1
	//if a==b return 0
	private static class MyComparator implements Comparator<Long> 
	{
		@Override
		public int compare(Long a, Long b)
		{
			int a3 = 0;
			int b3 = 0;
			
			while(a%3==0)
			{
				a/=3;
				a3++;
			}
			while(b%3==0)
			{
				b/=3;
				b3++;
			}
			
			if(a3>b3)
			{
				return -1;
			}
			else if(a3 == b3 && a<b)
			{
				return -1;
			}
			return 1;
			
		}
	}
	*/


    private static Scanner sc = new Scanner(System.in);
	
	
	public static void main(String[] args) 
    {
		int n = sc.nextInt();
		int m = sc.nextInt();
		int q = sc.nextInt();
		
		sc.nextLine();
		String s = sc.nextLine();
		String t = sc.nextLine();
		
		int[] answer = new int[1234];
		for(int i=0;i<n;i++)
		{
			if(i+m > n)
			{
				break;
			}
			
			int flag = 1;
			for(int j = 0;j<m;j++)
			{
				if(s.charAt(i+j) != t.charAt(j))flag = 0;
			}
			if(flag == 1)answer[i]=1;
			
			
		}
		
		while(q-- > 0)
		{
			int left = sc.nextInt();
			int right = sc.nextInt();
			left--;
			right--;
			right -= (m-1);
			int qwe = 0;
			for(int i=left;i<=right;i++)qwe+=answer[i];
			System.out.println(qwe);
		
		}
		
	}

}





/*
done 1
9 14 
10 15
*/
