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.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class B {
    public static void main(String[] args) throws Exception {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        // Scanner scan = new Scanner(System.in);
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        // int n = Integer.parseInt(bf.readLine());
        StringTokenizer st = new StringTokenizer(bf.readLine());
        // int[] a = new int[n]; for(int i=0; i<n; i++) a[i] = Integer.parseInt(st.nextToken());
        int n = Integer.parseInt(st.nextToken());
        int m = Integer.parseInt(st.nextToken());
        int q = Integer.parseInt(st.nextToken());
        String s = bf.readLine();
        String t = bf.readLine();
        int MOD = 1000000009;
        int base = 70709;
        Random rand = new Random();
        int[] hash_value = new int[26];
        for(int i=0; i<26; i++) hash_value[i] = 2+rand.nextInt(MOD-4);
        long[] hash = new long[n+1];
        hash[0] = 0;
        for(int i=1; i<=n; i++) {
          hash[i] = (hash[i-1] + 1L*hash_value[(s.charAt(i-1)-'a')]*exp(base, i-1, MOD) % MOD) % MOD;
        }
        long desired = 0;
        for(int i=1; i<=m; i++) {
          desired = (desired + 1L*hash_value[(t.charAt(i-1)-'a')]*exp(base, i-1, MOD) % MOD)% MOD;
        }
      //  out.println(desired);
        int[] count = new int[n];
        for(int i=0; i<=n-m; i++) {
          long hash_Val  = ((hash[i+m]-hash[i] + MOD) % MOD)*inv(exp(base, i, MOD), MOD) % MOD;
        //  out.println(hash_Val);
          if(hash_Val == desired) count[i]++;
        }
        //out.println(Arrays.toString(count));
        int[] pref_sum = new int[n+1];
        pref_sum[0] = 0;
        for(int i=1; i<n+1; i++) pref_sum[i] = pref_sum[i-1] + count[i-1];
        for(int i=0; i<q; i++) {
          st = new StringTokenizer(bf.readLine());
          int l = Integer.parseInt(st.nextToken()) - 1;
          int r = Integer.parseInt(st.nextToken()) - 1;
          r = r-m+1+1;
          l = l-1+1;
          if((l <= r) && (0 <= l) && (r <= n))
            out.println((pref_sum[r]-pref_sum[l]));
          else
            out.println(0);
        }

        // int n = scan.nextInt();

        out.close(); System.exit(0);
    }
    public static int exp(int base, int e, int mod) {
      if(e == 0) return 1;
      if(e == 1) return base;
      int val = exp(base, e/2, mod);
      int ans = (int)(1L*val*val % mod);
      if(e % 2 == 1)
        ans = (int)(1L*ans*base % mod);
      return ans;
    }
    public static int inv(int base, int mod) {
      return exp(base, mod-2, mod);
    }
}
