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.
def ind(r,g,low,up):
    if(up-low==0):
        if(r[low]>g):
            return(low)
        else:
            return(low+1)            
    elif(up-low==1):
        if(r[low]>g):
            return(low)
        elif(r[low+1]>g):
            return(low+1)
        else:
            return(low+2)
    else:
        k=((up+low)//2)
        if(r[k]<g):
            u=ind(r,g,k,up)
            return(u)
        else:
            u=ind(r,g,low,k)
            return(u)
n,m,t=map(int,raw_input().split())
s1=str(raw_input())
s2=str(raw_input())
d=[]
for i in range(n-m+2):
    try:
        if(s1[i:(i+m):1]==s2):
            d.append(i)
    except:
        pass
r=len(d)
for i in range(t):
    a,b=map(int,raw_input().split())
    low=a-2
    up=b-m
    if(up>low):
        try:
            print(ind(d,up,0,r-1)-ind(d,low,0,r-1))
        except:
            print(0)
    else:
        print(0)