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.
a1 = list(map(int, input().split(' ')[:3]))
bigString = input()
littleString = input()
all = 0
left = [0]*len(bigString)
right = [0]*len(bigString)
leftCount = 0
rightCount = 0
for i in range(len(bigString)):
    left[i] = leftCount
    if bigString.find(littleString,i,i + len(littleString)) != -1:
        leftCount += 1
for i in range(len(bigString) - 1, -1, -1):
    #print(i)
    right[i] = rightCount
    if bigString.find(littleString,i - len(littleString) + 1, i + 1) != -1:
        rightCount += 1
for i in range(len(bigString)):
    if bigString.find(littleString,i,i + len(littleString)) != -1:
        all += 1
#print(left)
#print(right)
#print(all, "all")
for s in range(a1[2]):
    a2 = list(map(int, input().split(' ')[:2]))
    a2[0] -= 1
    a2[1] -= 1
    if a2[1] - a2[0] < len(littleString) - 1:
        print(0)
    else:
        result = all - right[a2[1]] - left[a2[0]]
        print(result)
