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.

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;

public class B {

    private static char T[], P[];
    private static int b[], n, m;
    private static ArrayList<Integer> subs;

    private static void kmpPreprocess() {
        b = new int[m + 1];
        int i = 0, j = -1;
        b[0] = -1;
        while (i < m) {
            while (j >= 0 && P[i] != P[j]) {
                j = b[j];
            }
            i++;
            j++;
            b[i] = j;
        }
    }

    private static void kmpSearch() {
        subs = new ArrayList<>();
        int i = 0, j = 0, k = 0;
        while (i < n) {
            while (j >= 0 && T[i] != P[j]) {
                j = b[j];
            }
            i++;
            j++;
            if (j == m) {
                subs.add(i - j);
                j = b[j];
            }
        }
    }

    private static int query(int a, int b) {
        b -= (m - 1);
        if (b < a || m > n) {
            return 0;
        }
        int sIdx = Collections.binarySearch(subs, a);
        if (sIdx < 0) {
            sIdx *= -1;
            sIdx--;
        }
        int eIdx = Collections.binarySearch(subs, b);
        if (eIdx < 0) {
            eIdx *= -1;
            eIdx -= 2;
        }
        return eIdx - sIdx + 1;

    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line = br.readLine().trim(), buffer[];
        buffer = line.split("\\s+");
        n = Integer.parseInt(buffer[0]);
        m = Integer.parseInt(buffer[1]);
        int Q = Integer.parseInt(buffer[2]);
        T = br.readLine().trim().toCharArray();
        P = br.readLine().trim().toCharArray();
        kmpPreprocess();
        kmpSearch();
        for (int i = 0; i < Q; i++) {
            line = br.readLine().trim();
            buffer = line.split("\\s+");
            int a = Integer.parseInt(buffer[0]) - 1;
            int b = Integer.parseInt(buffer[1]) - 1;
            System.out.println(query(a, b));
        }

    }
}
