#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
using namespace std;
template<typename T>
inline bool cmax(T&x,const T& y){return x<y?x=y,1:0;}
template<typename T>
inline bool cmin(T&x,const T& y){return y<x?x=y,1:0;}
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vector<int> > vii; 
typedef unsigned long long ull;
#define sz(x) (int(x.size()))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define em emplace
#define X first
#define Y second
const int mod=998244353;
inline void MOD(int&x){x-=mod,x+=x>>31&mod;}
inline void MOD(ll& x){x-=mod,x+=x>>63&mod;}
inline int add(int x,int y){MOD(x+=y);return x;}
inline int mul(int x,int y){return 1ll*x*y%mod;}
template<typename ... A>inline int mul(const int& x,const A&... p){return 1ll*x*mul(p...)%mod;}
inline ll ksm(ll a,ll p=mod-2){ll ans=1;for(;p;p>>=1,a=a*a%mod)if(p&1)ans=ans*a%mod;return ans;}
typedef long double LD;
constexpr int MAXN=400+10;
struct edge{int from,v,cap,w;};
vector<edge>e(2);
int head[MAXN];
inline void adde(int u,int v,int cap,int w)
{
    e.push_back({head[u],v,cap,w});head[u]=sz(e)-1;
    e.push_back({head[v],u,0,-w}),head[v]=sz(e)-1;
}
int s,t;
ll dis[MAXN];
int pre[MAXN],flow[MAXN];
bool vis[MAXN];
inline bool spfa()
{
    memset(dis,0x3f,sizeof(dis));
    dis[s]=0;queue<int>q;q.push(s);
    flow[s]=1<<30;
    while(!q.empty())
    {
        int u=q.front();q.pop();vis[u]=0;
        for(int i=head[u];i;i=e[i].from)
        {
            int v=e[i].v;
            if(e[i].cap&&cmin(dis[v],dis[u]+e[i].w))
            {
                flow[v]=min(flow[u],e[i].cap);
                pre[v]=i;
                if(!vis[v])vis[v]=1,q.push(v);
            }
        }
    }
    return dis[t]!=dis[MAXN-1];
}
int maxflow,mincost;
void EK()
{
    while(spfa())
    {
        maxflow+=flow[t];
        mincost+=flow[t]*dis[t];
        int u=t;
        while(u!=s)
        {
            e[pre[u]].cap-=flow[t],e[pre[u]^1].cap+=flow[t];
            u=e[pre[u]^1].v;
        }
    }
}
int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);cout<<fixed<<setprecision(10);
	int n,m;cin>>n>>m;
    s=1,t=n;
    for(int i=1,u,v,a,b;i<=m;i++)cin>>u>>v>>a>>b,adde(u,v,a,b);
    EK();
    cout<<maxflow<<' '<<mincost;
	return 0;
}