#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ms(a, b) memset(a, b, sizeof(a))
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define random(a, b) rand()*rand()%(b-a+1)+a
#define pi acos(-1.0)
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5+10;
const int maxm = 1e5+10;
const ll mod = 1e9+7;struct ND{ll x,y,t,w;ND(){}ND(int _x,int _y,int _t,int _w){ x=_x,y=_y,t=_t,w=_w; }bool operator <(const ND &a)const{return x*x+y*y<a.x*a.x+a.y*a.y;}
}p[1010];
bool aLine(ND a,ND b){if(a.x*b.y==a.y*b.x) return a.x*b.x>=0&&a.y*b.y>=0;return false;
}
vector<ND> group[1010];
bool vis[1010];
ll dp[10100];
int main(){
#ifdef LOCALfreopen("in.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
#endifint x0,y0,t,n;while(~scanf("%d%d%d%d",&x0,&y0,&n,&t)){for(int i=0;i<n;i++){scanf("%lld%lld%lld%lld",&p[i].x,&p[i].y,&p[i].t,&p[i].w);group[i].clear();p[i].x-=x0;p[i].y-=y0;}
//        if(aLine(p[0],p[1])) puts("YED");sort(p,p+n);//按距城市的距离排序memset(vis,false,sizeof(vis));int cnt=0;for(int i=0;i<n;i++){//分组if(!vis[i]){group[cnt].push_back(p[i]);vis[i]=true;for(int j=i+1;j<n;j++){if(aLine(p[i],p[j])){vis[j]=true;if(p[j].t==0){group[cnt][group[cnt].size()-1].w+=p[j].w;continue;}group[cnt].push_back(p[j]);group[cnt][group[cnt].size()-1].w+=group[cnt][group[cnt].size()-2].w;group[cnt][group[cnt].size()-1].t+=group[cnt][group[cnt].size()-2].t;}}cnt++;}}
//        for(int i=0;i<cnt;i++){
//            for(int j=0;j<group[i].size();j++){
//                cout<<'('<<group[i][j].x<<','<<group[i][j].y<<')'<<' ';
//            }cout<<endl;
//        }memset(dp,0,sizeof(dp));for(int i=0;i<cnt;i++){for(int j=t;j>=0;--j){for(int k=0;k<group[i].size()&&group[i][k].t<=j;k++){dp[j]=max(dp[j],dp[j-group[i][k].t]+group[i][k].w);}}}cout<<dp[t]<<endl;}return 0;
}