1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define PPC(x) __builtin_popcount(x)
#define MSB(x) (63 - __builtin_clzll(x))
#define SZ(x) ((int)(x).size())
#define HASK(S, x) (S.find(x) != S.end())
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define ithBit(m, i) ((m) >> (i) & 1)
#define ft first
#define sd second
#define kw(a) ((a) * (a))
#ifdef DEBUG
//#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std; 

template <typename T1, typename T2> inline void remin(T1& a, T2 b) { a = min(a, (T1)b);	}

const int maxN = 3210;

int nxt[maxN][maxN];

int go(int i0, int im, int j0, int jm)
{
	int inf = jm+1;
	vector <int> sts(1, inf);
	FOR(i, i0, im+1)
	{
		int j = nxt[i][j0-1];		
		for (int& s : sts)
		{
			int j2 = nxt[i][s];
			remin(s, j);
			j = j2;
		}
		if (sts.back() != inf)
			sts.pb(inf);
	}
	return SZ(sts) - 1;
}

char T[maxN], S[maxN];

void solve()
{
	int n, m, q;
	scanf ("%d%d%d", &n, &m, &q);
	scanf ("%s %s", T+1, S+1);
	
	FORD(i, n, 0)
	{
		nxt[i][m] = nxt[i][m+1] = m+2;
		FORD(j, m-1, -1)
			nxt[i][j] = T[i] == S[j+1] ? j+1 : nxt[i][j+1];
	}
	
	while (q--)
	{
		int a, b, c, d;
		scanf ("%d%d%d%d", &a, &b, &c, &d);
		printf("%d\n", go(a, b, c, d));
	}
}
 
int main()
{
	int t = 1;
	//scanf ("%d", &t);
	FOR(tid, 1, t+1)
	{
		//printf("Case #%d: ", tid);
		solve();
	}
	return 0;
}