B. Segment Occurrences

题意：q个询问[l，r]，字符串t在s中出现次数；

思路：出来出现的l，r；二分查找l，r注意查2，2的-1情况~~； 

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x;
        x=x*x;
        n>>=1;
    }
    return ans;
}


vector<int >L,R;

int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n,m,q;
    cin>>n>>m>>q;
    string s,t;
    cin>>s>>t;
    for(int i=0;i<n;i++)
    {
        bool f=1;
        for(int j=0;j<m;j++)
        {
            if(s[i+j]!=t[j])
            {
                f=0;
                break;
            }
        }
        if(f)
        {
            L.push_back(i);
            R.push_back(i+m-1);
            //cout<<i<<" "<<i+m-1<<endl;
        }
    }
    L.push_back(INF);
    R.push_back(INF);
    while(q--)
    {
        int l,r;
        cin>>l>>r;
        l--;
        r--;
        int k=lower_bound(L.begin(),L.end(),l)-L.begin();
        int kk=upper_bound(R.begin(),R.end(),r)-R.begin();
        cout<<max(0,kk-k)<<endl;
    }
	return 0;
}