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 prefix_func(s):
    slen, k = len(s), 0
    p = [0]*slen
    p[0] = 0
    for i in range(1, slen):
        while k>0 and s[k] != s[i]:
            k = p[k-1]
        if s[k] == s[i]:
            k += 1
        p[i] = k
    return p


def kmp(s, p):
    q, slen, plen = 0, len(s), len(p)
    res = []
    pi = prefix_func(p)
    for i in range(slen):
        while q>0 and p[q] != s[i]:
            q = pi[q-1]
        if p[q] == s[i]:
            q += 1
        if q == plen:
            res.append(i-plen+1)
            q = pi[q-1]
    return res


n,m,q = map(int, input().split())
s = input()
t = input()
matches = kmp(s,t)
match_count = [0]*(len(s)+1)
for m in matches:
    match_count[m] = 1
count = 0
for i in range(len(s)-1, 0, -1):
    match_count[i-1] += match_count[i]
for i in range(q):
    l, r = map(int, input().split())
    r += 1
    ans = 0
    if r-l >= len(t):
        ans = match_count[l-1] - match_count[r-len(t)]
    print(ans)
