#include<bits/stdc++.h>
#define il inline
#define reg register int
#define numb (ch^'0')
#define mid ((l+r)>>1)
using namespace std;
typedef long long ll;
il void rd(int &x){char ch;bool fl=false;while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);for(x=numb;isdigit(ch=getchar());x=x*10+numb);(fl==true)&&(x=-x);
}
namespace Miracle{
const int N=1050;
int n,m,k;
struct node{int ans[2*N],laz[2*N];void upda(int x,int l,int r,int L,int R,int c){ans[x]=max(ans[x],c);if(L<=l&&r<=R) {laz[x]=max(laz[x],c);return;}if(L<=mid) upda(x<<1,l,mid,L,R,c);if(mid<R) upda(x<<1|1,mid+1,r,L,R,c);}int query(int x,int l,int r,int L,int R){if(L<=l&&r<=R){return ans[x];}int ret=laz[x];if(L<=mid) ret=max(ret,query(x<<1,l,mid,L,R));if(mid<R) ret=max(ret,query(x<<1|1,mid+1,r,L,R));return ret;}
}mx[2*N],tag[2*N];
void upda(int x,int l,int r,int l1,int r1,int l2,int r2,int c){mx[x].upda(1,1,m,l2,r2,c);if(l1<=l&&r<=r1){tag[x].upda(1,1,m,l2,r2,c);return;}if(l1<=mid) upda(x<<1,l,mid,l1,r1,l2,r2,c);if(mid<r1) upda(x<<1|1,mid+1,r,l1,r1,l2,r2,c);
}
int query(int x,int l,int r,int l1,int r1,int l2,int r2){if(l1<=l&&r<=r1) return mx[x].query(1,1,m,l2,r2);int ret=tag[x].query(1,1,m,l2,r2);if(l1<=mid) ret=max(ret,query(x<<1,l,mid,l1,r1,l2,r2));if(mid<r1) ret=max(ret,query(x<<1|1,mid+1,r,l1,r1,l2,r2));return ret;
}
int main(){rd(n);rd(m);rd(k);int x,y,s,d,h;while(k--){rd(d);rd(s);rd(h);rd(x);rd(y);++x,++y;int ch=query(1,1,n,x,x+d-1,y,y+s-1)+h;upda(1,1,n,x,x+d-1,y,y+s-1,ch);}printf("%d",query(1,1,n,1,n,1,m));return 0;
}}
signed main(){Miracle::main();return 0;
}/*Author: *Miracle*Date: 2018/12/9 18:33:23
*/