B. Segment Occurrences

B. Segment Occurrences

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given two strings $\mathrm{ss and tt,\; both\; consisting\; only\; of\; lowercase\; Latin\; letters.}$

The substring $\mathrm{s[l..r]s[l..r] is\; the\; string\; which\; is\; obtained\; by\; taking\; characters sl,sl+1,\dots ,srsl,sl+1,\dots ,sr without\; changing\; the\; order.}$

Each of the occurrences of string $\mathrm{aa in\; a\; string bb is\; a\; position ii (1\le i\le |b|-|a|+11\le i\le |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 $\mathrm{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 $\mathrm{nn, mm and qq (1\le n,m\le 1031\le n,m\le 103, 1\le q\le 1051\le q\le 105)\; —\; the\; length\; of\; string ss,\; the\; length\; of\; string ttand\; the\; number\; of\; queries,\; respectively.}$

The second line is a string $\mathrm{ss (|s|=n|s|=n),\; consisting\; only\; of\; lowercase\; Latin\; letters.}$

The third line is a string $\mathrm{tt (|t|=m|t|=m),\; consisting\; only\; of\; lowercase\; Latin\; letters.}$

Each of the next $\mathrm{qq lines\; contains\; two\; integer\; numbers lili and riri (1\le li\le ri\le n1\le li\le ri\le n)\; —\; the\; arguments\; for\; the ii-th\; query.}$

Output

Print $\mathrm{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

Copy

10 3 4
codeforces
for
1 3
3 10
5 6
5 7

output

Copy

0
1
0
1

input

Copy

15 2 3
abacabadabacaba
ba
1 15
3 4
2 14

output

Copy

4
0
3

input

Copy

3 5 2
aaa
baaab
1 3
1 1

output

Copy

0
0

Note

In the first example the queries are substrings: "cod", "deforces", "fo" and "for", respectively.

给两个字符串s，t，之后给出s的一个区间，问这个子串中存在多少个子串与t相同

前缀和相减,但是又带有一定技巧.

#include <bits/stdc++.h>
#define ll long long int
#define inf 0x3f3f3f3f
#define N 1000005
using namespace std;
int a[1005];
int n,m,k;
int main(){
    cin>>n>>m>>k;
    string s,ss;
    cin>>s>>ss;
    for(int i=0;i<=n-m;i++){
        bool flag = true;
        for(int j=0;j<m;j++){
            if(s[i+j]!=ss[j]){
                flag = false;
                break;
            }
        }
        if(flag){
            a[i+1]++;
        }
    }
    for(int i=1;i<=n;i++){
        a[i] += a[i-1];
    }
    for(int i=0;i<k;i++){
        int x,y;
        cin>>x>>y;
        y = y-m+1;
        if(x>y){
            cout<<"0"<<endl;
        }else{
            cout<<a[y]-a[x-1]<<endl;
        }
    }
    return 0;
}