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
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<utility>
#include<functional>
#include<iomanip>
#include<sstream>
#include<ctime>
#include<cassert>
using namespace std;
#define y0 y0z
#define y1 y1z
#define yn ynz
#define j0 j0z
#define j1 j1z
#define jn jnz
#define tm tmz
#define buli(x) (__builtin_popcount(x))
#define bur0(x) (__builtin_ctzll(x))
#define bul2(x) (63-__builtin_clzll(x))
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fil(a,b) memset((a),(b),sizeof(a))
#define cl(a) fil(a,0)
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define rep(i,a,b) for (int i=(a),_ed=(b);i<_ed;i++)
#define per(i,a,b) for (int i=(b)-1,_ed=(a);i>=_ed;i--)
#define forg(i,gu) for (int i=gu;~i;i=e[i].next)
#define pw(x) ((ll(1))<<(x))
#define upmo(a,b) (((a)=((a)+(b))%mo)<0?(a)+=mo:(a))
#define mmo(a,b) (((a)=1ll*(a)*(b)%mo)<0?(a)+=mo:(a))
void getre(){int x=0;printf("%d\n",1/x);}
void gettle(){int res=1;while(1)res<<=1;printf("%d\n",res);}
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
template<typename T,typename S>inline bool upmin(T&a,const S&b){return a>b?a=b,1:0;}
template<typename T,typename S>inline bool upmax(T&a,const S&b){return a<b?a=b,1:0;}
template<typename N,typename PN>inline N flo(N a,PN b){return a>=0?a/b:-((-a-1)/b)-1;}
template<typename N,typename PN>inline N cei(N a,PN b){return a>0?(a-1)/b+1:-(-a/b);}
template<typename N>N gcd(N a,N b){return b?gcd(b,a%b):a;}
template<typename N>inline int sgn(N a){return a>0?1:(a<0?-1:0);}
#if ( ( _WIN32 || __WIN32__ ) && __cplusplus < 201103L)
#define lld "%I64d"
#else
#define lld "%lld"
#endif
inline void gn(long long&x){
	int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');c=='-'?(sg=-1,x=0):(x=c-'0');
	while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg;
}
inline void gn(int&x){long long t;gn(t);x=t;}
inline void gn(unsigned long long&x){long long t;gn(t);x=t;}
inline void gn(double&x){double t;scanf("%lf",&t);x=t;}
inline void gn(long double&x){double t;scanf("%lf",&t);x=t;}
inline void gs(char *s){scanf("%s",s);}
inline void gc(char &c){while((c=getchar())>126 || c<33);}
inline void pc(char c){putchar(c);}
#ifdef JCVB
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif
typedef long long ll;
typedef double db;
inline ll sqr(ll a){return a*a;}
inline db sqrf(db a){return a*a;}
const int inf=0x3f3f3f3f;
//const ll inf=0x3f3f3f3f3f3f3f3fll;
const db pi=3.14159265358979323846264338327950288L;
const db eps=1e-6;
//const int mo=0;
//int qp(int a,ll b){int n=1;do{if(b&1)n=1ll*n*a%mo;a=1ll*a*a%mo;}while(b>>=1);return n;}
const int N=3005,Q = 100005;

char strs[N],strt[N];
char reverses[N],reverset[N];
int n,m;
int q;
int mid_for_compare;
struct query{
	int i1,i2;// 1..n   i1<=i2
	int j1,j2;// 1..m
	int id;
	int typ()const{ 
		if(i2<=mid_for_compare-1) return 1;
		if(i1>=mid_for_compare+1) return 2;
		return 0;
	}
	void read(int i){
		id=i;
		//i1=rand()%10+1,i2=n-rand()%10;
		//j1=rand()%10+1,j2=n-rand()%10;
		gn(i1);gn(i2);
		gn(j1);gn(j2);
	}
}queries[Q]; int queryans[Q];

int cmp(const query&a,const query&b) {
	return a.typ()<b.typ();
}

int lcs[N][N];
int dell[N][N],delu[N][N];
int rightj[N][N];
void dolcs(char *s,int n,char *t,int m) {//s[1..n]
	rep(i,0,n+1)lcs[i][0]=dell[i][0]=delu[i][0]=dell[i][m+1]=0;
	rep(j,0,m+1)lcs[0][j]=dell[0][j]=delu[0][j]=0;
	rep(i,1,n+1)
		rep(j,1,m+1) {
			if(s[i]==t[j]) lcs[i][j] = lcs[i-1][j-1]+1;
			else lcs[i][j]=max(lcs[i-1][j],lcs[i][j-1]);
			dell[i][j]=lcs[i][j]-lcs[i][j-1];
			delu[i][j]=lcs[i][j]-lcs[i-1][j];
		}
	rep(jdel,1,m+1) {
		rightj[jdel][0]=jdel;
		int leftminus=0;
		for (int curi=1, curj=jdel;curi<=n;curi++) {
			while(curj<=m) {
				if(curj!=jdel)leftminus=1;
				int after;
				if(curj!=jdel && s[curi]==t[curj])after=0 - delu[curi][curj]- dell[curi-1][curj]+1;
				else after = max(0-dell[curi][curj]-leftminus,0-delu[curi][curj]);
				if(after==0)break;
				//   after = -1
				curj++;
			}
			rightj[jdel][curi]=curj;
			dell[curi][rightj[jdel][curi]]++;
		}
		rep(i,1,n+1){
			rep(j,rightj[jdel][i-1],rightj[jdel][i])delu[i][j]--;
		}
	}
	return;
}

vector<int> savequery[N][N];
vector<int> savebound[N];

int qdownoldlcs[Q],qupoldlcs[Q];
int qbitdown[Q][N/32+3];
int qbitup[Q][N/32+3];
int qbitupsum[Q];

unsigned int bitdownremove[N];
unsigned int bitupremove[N];

int tempup[N],tempdown[N];
void gao(int il,int ir,int qbegin,int qend) {
	if(il>ir)return;
	if(qbegin==qend)return;

	int mid=il+ir>>1;
	mid_for_compare = mid;
	rep(i,mid,ir+1)rep(j,1,m+1)savequery[i][j].clear();
	sort(queries+qbegin,queries+qend,cmp);
	int qend0=qbegin,qend1=qbegin;
	rep(j,qbegin,qend) {
		if(queries[j].typ()==0)qend0=j+1;
		if(queries[j].typ()<=1)qend1=j+1;
	}

	if(qbegin!=qend0) {
		dolcs(strs+mid,ir-mid,strt,m);  
		rep(q,qbegin,qend0) {
			qdownoldlcs[q] = lcs[queries[q].i2-mid][queries[q].j2];
			savequery[queries[q].i2][queries[q].j2].pb(q);
		}
		rep(i,mid+1,ir+1) {
			rep(jdel,0,m+1)savebound[jdel].clear();
			rep(jdel,1,m+1) {
				savebound[rightj[jdel][i-mid]-1].pb(jdel);
			}
			rep(t,0,m/32+1)bitdownremove[t]=0;
			per(jdel,1,m+1) {
				for(int k=0;k<savebound[jdel].size();k++) {
					int x = savebound[jdel][k];
					bitdownremove[x/32]|=((unsigned)1)<<(x&31);
				}
				for(int k=0;k<savequery[i][jdel].size();k++) {
					int x = savequery[i][jdel][k];
					rep(t,0,m/32+1)
						qbitdown[x][t]=bitdownremove[t];
				}
			}
		}
		// s[il..mid] = reverses[n-mid+1..n-il+1]
		rep(i,il,mid+1)rep(j,1,m+1)savequery[i][j].clear();
		dolcs(reverses+n-mid,mid-il+1,reverset,m);
		rep(q,qbegin,qend0) {
			qupoldlcs[q] = lcs[mid-queries[q].i1+1][m-queries[q].j1+1];
			savequery[queries[q].i1][queries[q].j1].pb(q);
		}
		per(i,il,mid+1) {
			rep(jdel,0,m+1)savebound[jdel].clear();
			rep(jdel,1,m+1) {
				savebound[rightj[jdel][mid-i+1]-1].pb(jdel);
			}
			rep(t,0,m/32+1)bitupremove[t]=0;
			per(jdel,1,m+1) {
				for(int k=0;k<savebound[jdel].size();k++) {
					int x = savebound[jdel][k];
					bitupremove[(m-x)/32]|=((unsigned)1)<<((m-x)&31);
				}
				for(int k=0;k<savequery[i][m-jdel+1].size();k++) {
					int x = savequery[i][m-jdel+1][k];
					qbitupsum[x]=0;
					rep(t,0,m/32+1) {
						qbitup[x][t]=bitupremove[t];
					}
				}
			}
		}
		rep(q,qbegin,qend0) {
			int sum  = qdownoldlcs[q]+qupoldlcs[q];
			rep(t,0,m/32+1) {
				if(t*32>=1 && (t+1)*32-1<=m-1)
					sum-=buli((unsigned int)qbitup[q][t]);
				else 
					for (int jj=t*32;jj<=(t+1)*32-1;jj++)
					if(jj>=1 && jj<=m-1 && ((qbitup[q][t]>>(jj&31))&1))sum--;
			}

			int ans=0;
			if(queries[q].j1-1==0) upmax(ans,qdownoldlcs[q]);
			rep(j,1,max(queries[q].j1-1,1)) {
				if((qbitdown[q][j/32]>>(j&31))&1) sum--;
				if((qbitup[q][(j)/32]>>((j)&31))&1) sum++;
			}
			rep(j,max(queries[q].j1-1,1),min(queries[q].j2+1,m)) {
				if((qbitdown[q][j/32]>>(j&31))&1) sum--;
				upmax(ans,sum);
				if((qbitup[q][(j)/32]>>((j)&31))&1) sum++;
			}
			if(queries[q].j2==m)upmax(ans,qupoldlcs[q]);
			queryans[queries[q].id]=ans;
		}
	}
	gao(il,mid-1,qend0,qend1);
	gao(mid+1,ir,qend1,qend);
}
int main()
{
#ifdef JCVB
	//freopen("1.in","r",stdin);
	//freopen("1.out","w",stdout);
	int _time_jc=clock();
#endif
	gn(n);gn(m);
	gn(q);
	//n=m=3000,q=100000;

	gs(strs+1);
	gs(strt+1);
	//rep(i,1,n+1)strs[i]=rand()%3+'a';
	//rep(i,1,m+1)strt[i]=rand()%3+'a';

	rep(i,1,n+1)reverses[i]=strs[n-i+1];
	rep(i,1,m+1)reverset[i]=strt[m-i+1];

	rep(i,1,q+1)queries[i].read(i);

	gao(1,n,1,q+1);

	rep(i,1,q+1)printf("%d\n",queryans[i]);

#ifdef JCVB
	debug("time: %d\n",int(clock()-_time_jc));
#endif
	return 0;
}