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.
from __future__ import print_function,division
import sys
if sys.version_info < (3, 0):
    range = xrange
input = sys.stdin.readline

class SegmentSum:
    def __init__(S,n):
        sz = 1
        while sz < n: sz <<= 1
        S.data = [0]*(n + sz)
        S.sz = sz
 
    def sum(S,l,r):
        sz = S.sz
        data = S.data
        summa = 0
 
        l += sz
        r += sz
 
        while l < r:
            if l%2==1:
                summa += data[l]
                l += 1
            if r%2==1:
                r -= 1
                summa += data[r]
            l >>= 1
            r >>= 1
        return summa
 
    def inc(S,pos):
        pos += S.sz
        while pos > 0:
            S.data[pos] += 1
            pos >>= 1

n,m,q = map(int,input().split())
s = input().strip()
t = input().strip()

T = SegmentSum(n)

i = 0
while True:
    i = s.find(t,i)
    if i == -1: break
    T.inc(i)
    i += 1

for _ in range(q):
    l,r = map(int,input().split())
    l -= 1
    r -= 1
    print(T.sum(l,r+2-m))
    
