CF Round 48 div2-B Segment Occurrences

You are given two strings ss and tt, both consisting only of lowercase Latin letters.

The substring s[l..r]s[l..r] is the string which is obtained by taking characters sl,sl+1,…,srsl,sl+1,…,sr without changing the order.

Each of the occurrences of string aa in a string bb is a position ii (1≤i≤|b|−|a|+11≤i≤|b|−|a|+1) such that b[i..i+|a|−1]=ab[i..i+|a|−1]=a (|a||a| is the length of string aa).

You are asked qq queries: for the ii-th query you are required to calculate the number of occurrences of string tt in a substring s[li..ri]s[li..ri].

Input

The first line contains three integer numbers nn, mm and qq (1≤n,m≤10^3 1≤n,m≤10^3, 1≤q≤10^5 1≤q≤10^5) — the length of string ss, the length of string ttand the number of queries, respectively.

The second line is a string ss (|s|=n|s|=n), consisting only of lowercase Latin letters.

The third line is a string tt (|t|=m|t|=m), consisting only of lowercase Latin letters.

Each of the next qq lines contains two integer numbers lili and riri (1≤li≤ri≤n1≤li≤ri≤n) — the arguments for the ii-th query.

Output

Print qq lines — the ii-th line should contain the answer to the ii-th query, that is the number of occurrences of string tt in a substring s[li..ri]s[li..ri].

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.

题目大意:给出2个串与多个查询，每个查询输入一个区间i，j，求字符串Ai-Aj中有多少个字符串B；

思路：这种题，直接模拟应该会炸吧，用数组预处理一下就行了。

代码如下：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1e5+10;
string s,t;
int main()
{
    int n,m,q,l,r;
    int ans[1005]={0};
    scanf("%d%d%d",&n,&m,&q);
    cin>>s>>t;
    for(int i=0;i+m<=n;i++)
    {
	    if(s.substr(i,m)==t) 
		ans[i+1]++;
	}
    for(int i=1;i<=n;i++)
    {
	    ans[i]+=ans[i-1];
	}
    while(q--)
    {
        scanf("%d%d",&l,&r);
        r-=m-1;
        if(r<0) r=0;
        printf("%d\n",max(0,ans[r]-ans[l-1]));
    }
    return 0;
}