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.

m, n, x = raw_input().split()
s = raw_input()
t = raw_input()
m, n, x = int(m), int(n), int(x)

class TreeNode(object):
    def __init__(self, l, r):
        self.left = None
        self.right = None
        self.interval = (l, r)
        self.val = 0

def build(start, end):
    # print start, end
    node = TreeNode(start, end)
    if start == end:
        if s[start:start+n] == t:
            node.val = 1
    elif start < end:
        mid = (start + end) / 2
        node.left = build(start, mid)
        node.right = build(mid+1, end)
        node.val = node.left.val + node.right.val
        # print node.val
    return node

def pt(root):
    print root.interval, root.val
    if root.left:
        pt(root.left)
    if root.right:
        pt(root.right)

root = build(0, m-1)

# pt(root)

def find(node, target):
    if target == node.interval[0]:
        return node.val
    if target > node.interval[1]:
        return 0
    mid = sum(node.interval) / 2
    if target == mid + 1:
        return node.right.val
    elif target < mid + 1:
        return node.right.val + find(node.left, target)
    else:
        return find(node.right, target)


for _ in xrange(int(x)):
    l, r = raw_input().split()
    l, r = int(l) - 1, int(r) - len(t)
    if r < l:
        print 0
        continue
    left = find(root, l)
    right = find(root, r + 1)
    print left - right



