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
#pragma GCC optimize("O3")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

#define BOOST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define FOR(a, b, c) for(int a = b; a < c; ++a)
#define PB push_back
#define MP make_pair
#define INF (int)1e9+7
#define LLINF 2e18+7
#define ALL(a) a.begin(), a.end()
#define SIZE(a) (int)a.size()

typedef unsigned long long ULL;
typedef long long LL;
typedef long double LD;

using namespace std;

//#define DEBUG

const int MAX = 607;

int DP[MAX][MAX];

int LCS(string a, string b)
{
    FOR(i, 0, SIZE(a) + 1)
        FOR(j, 0, SIZE(b) + 1)
            DP[i][j] = 0;

    FOR(i, 1, SIZE(a) + 1)
    {
        FOR(j, 1, SIZE(b) + 1)
        {
            DP[i][j] = max(DP[i - 1][j], DP[i][j - 1]);

            if(a[i - 1] == b[j - 1])
                DP[i][j] = DP[i - 1][j - 1] + 1;
        }
    }

    return DP[SIZE(a)][SIZE(b)];
}

int main()
{
    #ifndef DEBUG
    BOOST;
    #endif

    int n, m, q;
    cin >> n >> m >> q;

    string a, b;
    cin >> a >> b;

    FOR(z, 0, q)
    {
        int pocz1, kon1, pocz2, kon2;
        cin >> pocz1 >> kon1 >> pocz2 >> kon2;

        cout << LCS(a.substr(pocz1 - 1, kon1 - pocz1 + 1), b.substr(pocz2 - 1, kon2 - pocz2 + 1)) << "\n";
    }
 
    return 0;
}