#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

using namespace std;

int read()

{

    int x=,f=;char c=getchar();

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

#define N 210

#define M 50000

#define S 0

#define T 201

#define inf 1000000000

int n,m,w,v,t=-,p[N],degree[N],l[M],tot=;

int cur[N],d[N],q[N],ans=;

struct data{int to,nxt,cap,flow;

}edge[M];

void addedge(int x,int y,int z)

{

    t++;edge[t].to=y,edge[t].nxt=p[x],edge[t].cap=z,edge[t].flow=,p[x]=t;

    t++;edge[t].to=x,edge[t].nxt=p[y],edge[t].cap=,edge[t].flow=,p[y]=t;

}

bool bfs(int s,int t)

{

    memset(d,,sizeof(d));d[s]=;

    int head=,tail=;q[]=s;

    do

    {

        int x=q[++head];

        for (int i=p[x];~i;i=edge[i].nxt)

        if (d[edge[i].to]==-&&edge[i].flow<edge[i].cap)

        {

            d[edge[i].to]=d[x]+;

            q[++tail]=edge[i].to;

        }

    }while (head<tail);

    return ~d[t];

}

int work(int k,int f,int t)

{

    if (k==t) return f;

    int used=;

    for (int i=cur[k];~i;i=edge[i].nxt)

    if (d[k]+==d[edge[i].to])

    {

        int w=work(edge[i].to,min(f-used,edge[i].cap-edge[i].flow),t);

        edge[i].flow+=w,edge[i^].flow-=w;

        if (edge[i].flow<edge[i].cap) cur[k]=i;

        used+=w;if (used==f) return f;

    }

    if (used==) d[k]=-;

    return used;

}

void dinic(int s,int t)

{

    while (bfs(s,t))

    {

        memcpy(cur,p,sizeof(p));

        ans+=work(s,inf,t);

    }

}

int main()

{

#ifndef ONLINE_JUDGE

    freopen("loj116.in","r",stdin);

    freopen("loj116.out","w",stdout);

    const char LL[]="%I64d";

#else

    const char LL[]="%lld";

#endif

    n=read(),m=read(),w=read(),v=read();

    memset(p,,sizeof(p));

    for (int i=;i<=m;i++)

    {

        int x=read(),y=read(),low=read(),high=read();

        addedge(x,y,high-low);

        degree[y]+=low,degree[x]-=low;

        l[i]=low;

    }

    for (int i=;i<=n;i++)

    if (degree[i]>) addedge(S,i,degree[i]),tot+=degree[i];

    else if (degree[i]<) addedge(i,T,-degree[i]);

    addedge(v,w,inf);

    dinic(S,T);

    if (ans<tot) cout<<"please go home to sleep";

    else ans=,dinic(w,v),cout<<ans;

    return ;

}