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.

a=[]
b=[]

for i in range(3):
    a.append(input())
for n in range(int(a[0].split(" ")[2])):
    b.append(input())


c=0
# while c<len(b):
#     l=int(b[c].split(" ")[0])
#     r=int(b[c].split(" ")[1])
#
#     d=a[1][l-1:r]
#
#     size = []
#     h=0
#     while h < (len(d)-len(a[2])+1 ):
#
#
#         size.append(d[h:len(a[2])+h].count(a[2]))
#         h=h+1
#
#
#
#     print(sum(size))
#     c=c+1
lent=0
d=[]
sum=[]
sum.append(0)
while lent<=int(a[0].split(" ")[0])-int(a[0].split(" ")[1]):
    # print(a[1][lent:int(a[0].split(" ")[1])+lent],lent,int(a[0].split(" ")[1])+lent)
    # print(a[2])

    if a[1][lent:int(a[0].split(" ")[1])+lent]== a[2]:
        d.append(1)
    else:
        d.append(0)
    sum.append(sum[lent]+d[lent])
    lent=lent+1

# print(d,sum)

for z in range(len(b)):
    l=int(b[z].split(" ")[0])
    r=int(b[z].split(" ")[1])-int(a[0].split(" ")[1])+1
    # print(l,r,d[l:r])
    if int(b[z].split(" ")[1])-l>=int(a[0].split(" ")[1])-1:

     print(sum[r]-sum[l-1])
    else:
        print(0)







