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

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
const int INF = 0x3f3f3f3f;

#define FOR(i,b,e) for(int i = (b); i < (e); i++)
#define TRAV(x,a) for(auto &x: (a))
#define SZ(x) ((int)x.size())
#define PB push_back
#define X first
#define Y second

int dp[3010][3010];

int lcs(string s, string t){
    FOR(i, 0, SZ(s)+1){
        FOR(j, 0, SZ(t)+1){
            if(i == 0 || j == 0) dp[i][j] = 0;
            else if(s[i-1] == t[j-1]) dp[i][j] = dp[i-1][j-1]+1;
            else dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
        }
    }
    return dp[SZ(s)][SZ(t)];
}

void solve(){
    int n, m, q;
    string s, t;
    cin >> n >> m >> q;
    cin >> s >> t;
    FOR(i, 0, q){
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        cout << lcs(s.substr(a-1, b-a+1), t.substr(c-1, d-c+1)) << '\n';
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    // int tt; cin >> tt;
    // FOR(te, 0, tt)
    solve();
    return 0;
}