#include <bits/stdc++.h>
#define endl '\n'
#define MAX 1000000
using namespace std;
typedef unsigned long long ull;
typedef long double db;
typedef long long ll;
mt19937 rnd(time(0));
const ll mod=1e9+7;
const ll INF=1e9;
struct edge{
    ll to,cap,cost,rev;
};
vector<edge>G[MAX];
int dis[MAX],pre[MAX],prevv[MAX];
bool vis[MAX];
int V,flow=0,cost=0;
void add_g(int from,int to,int cap,int cost){
    G[from].push_back((edge){to,cap,cost,(ll)G[to].size()});
    G[to].push_back((edge){from,0,-cost,(ll)G[from].size()-1});
}
bool spfa(int s,int t){
    queue<int>que;
    for(int i=0;i<=V;i++) dis[i]=INF;
    que.push(s);
    dis[s]=0;vis[s]=1;
    while(!que.empty()){
        int u=que.front();
        que.pop();
        for(int i=0;i<G[u].size();i++){
            edge &e=G[u][i];
            if(e.cap>0&&dis[u]+e.cost<dis[e.to]){
                dis[e.to]=dis[u]+e.cost;
                pre[e.to]=i;
                prevv[e.to]=u;
                if(!vis[e.to]){
                    que.push(e.to);
                    vis[e.to]=1; 
                }
            }
        }
        vis[u]=false;
    }
    return dis[t]!=INF;
}
void augment(int s,int t){
    ll f=INF;
    for(int u=t;u!=s;u=prevv[u]){
        f=min(f,G[prevv[u]][pre[u]].cap);
    }
    flow+=f;
    cost+=f*dis[t];
    for(int u=t;u!=s;u=prevv[u]){
        edge &e=G[prevv[u]][pre[u]];
        e.cap-=f;
        G[u][e.rev].cap+=f;
    }
}
void mcf(int s,int t){
    flow=0;
    cost=0;
    while(spfa(s,t)) augment(s,t);
}
void solve(){
    int n,m;
    cin >> n >> m;
    V=m;
    while(m--){
        int u,v,f,c;
        cin >> u >> v >> f >> c;
        add_g(u,v,f,c);
    }
    mcf(1,n);
    cout << flow << " " << cost << "\n";
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cout << fixed << setprecision(15);
    int T = 1;
    //cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}