MLE（各一个）求助！！！

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,k,q,ls,s,ansl,l,r;
//long long N=500001;
vector<ll>a[500001],v[500001],ans[500001];
int main()
{
	//freopen("p8572.in","r",stdin);
	cin>>n>>k>>q;
	for(int i=1;i<=k;i++){
		s=0;
		v[i].push_back(0);
		for(int j=1;j<=n;j++){
			cin>>ls;
			s+=ls;
			//a[i].push_back(ls);
			v[i].push_back(s);
		}
	}
	
	//cout<<v[1].size();
	for(int j=1;j<=n;j++){
		
			ans[j].push_back(0);
		
	}
	for(int j=1;j<=n;j++){
		for(int c=j;c<=n;c++){
			ansl=0;
			for(int i=1;i<=k;i++){
				ansl=max(ansl,v[i][c]-v[i][j-1]);
				
			}
			
			ans[j].push_back(ansl);
		}
	}
	for(int i=1;i<=q;i++){
		cin>>l>>r;
		cout<<ans[l][r-l+1]<<endl;
	}
	
	return 0;
}