#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,ll> pil;
#define fir first
#define sec second
const int maxn=405;
const int maxm=15005;
const int inf=0x3f3f3f3f;
const ll llinf=0x3f3f3f3f3f3f3f3f;

int read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}

int n,m;
int S,T;
struct edge{
    int to,nxt,w,c;
}e[maxm<<1];
int head[maxn],cnt;
inline void add_edge(int u,int v,int w,int c){
    e[++cnt].to=v,e[cnt].nxt=head[u],head[u]=cnt,e[cnt].w=w,e[cnt].c=c;
    e[++cnt].to=u,e[cnt].nxt=head[v],head[v]=cnt,e[cnt].w=0,e[cnt].c=-c;
}

bool vis[maxn];
ll h[maxn];
queue<int> Q;
void SPFA(){
    memset(vis,0,sizeof(vis));
    memset(h,0x3f,sizeof(h));
    vis[S]=true,h[S]=0;
    Q.push(S);
    while(!Q.empty()){
        int u=Q.front();
        Q.pop();
        vis[u]=false;
        for(int i=head[u],v,w;i;i=e[i].nxt){
            if(!e[i].w) continue;
            v=e[i].to,w=e[i].c;
            if(h[u]+w<h[v]){
                h[v]=h[u]+w;
                if(!vis[v]){
                    vis[v]=true;
                    Q.push(v);
                }
            }
        }
    }
}
struct Data{
    int u;
    ll d;
    Data()=default;
    Data(int u_,ll d_):u(u_),d(d_){}
    bool operator<(const Data &rhs)const{
        return d>rhs.d;
    }
};
ll dis[maxn];
int pre[maxn];
priority_queue<Data> PQ;
void Dijkstra(){
    memset(vis,0,sizeof(vis));
    memset(dis,0x3f,sizeof(dis));
    dis[S]=0;
    PQ.push(Data(S,0));
    while(!PQ.empty()){
        int u=PQ.top().u;
        PQ.pop();
        if(vis[u]) continue;
        vis[u]=true;
        for(int i=head[u],v;i;i=e[i].nxt){
            if(!e[i].w) continue;
            v=e[i].to;
            ll w=e[i].c+h[u]-h[v];
            if(dis[u]+w<dis[v]){
                dis[v]=dis[u]+w,pre[v]=i;
                PQ.push(Data(v,dis[v]));
            }
        }
    }
}
pil MCMF(){
    pil res=make_pair(0,0);
    SPFA();
    while(1){
        Dijkstra();
        if(dis[T]==llinf) return res;
        for(int u=1;u<=n;++u) h[u]+=dis[u];
        int mn=inf;
        for(int u=T;u!=S;u=e[pre[u]^1].to) mn=min(mn,e[pre[u]].w);
        res.fir+=mn;
        for(int u=T;u!=S;u=e[pre[u]^1].to){
            res.sec+=1ll*e[pre[u]].c*mn;
            e[pre[u]].w-=mn,e[pre[u]^1].w+=mn;
        }
    }
}

int main(){
    // freopen("test.in","r",stdin);
    n=read(),m=read();
    S=1,T=n;
    cnt=1;
    for(int i=1,u,v,w,c;i<=m;++i){
        u=read(),v=read(),w=read(),c=read();
        add_edge(u,v,w,c);
    }
    pil ans=MCMF();
    printf("%d %lld\n",ans.fir,ans.sec);
    return 0;
}