#include <set>
#include <map>
#include <list>
#include <queue>
#include <cmath>
#include <time.h>
#include <random>
#include <bitset>
#include <vector>
#include <cstdio>
#include <stdio.h>
#include <iomanip>
#include <assert.h>
#include <stdlib.h>
#include <memory.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define mk make_pair
#define fi first
#define se second

char buf[1 << 20],*p1,*p2;
inline char gc(){
	if (p1 == p2){
		p1 = buf;
		p2 = buf + fread(buf,1,1 << 20,stdin);
	}
	return p1 == p2 ? EOF : *p1++;
	// return getchar();
}

inline int read(){
	int t = 0,f = 1;
	register char c = gc();
	while (c < 48 || c > 57) f = (c == '-') ? (-1) : (f),c = gc();
	while (c >= 48 && c <= 57) t = (t << 1) + (t << 3) + (c ^ 48),c = gc();
	return f * t;
}

const int N = 400 + 3,M = 2e5 + 3,INF = 0x3f3f3f3f;
int n,m;

struct Edge {int u,v,w,c,nxt;};

namespace f{
	int n,m,etot = 1,head[N],dis[N],fr[N];
	bool inq[N];
	int ans,cost;
	Edge e[M << 1];
	queue <int> q;
	inline void adde(int u,int v,int w,int c){
		e[++etot] = (Edge){u,v,w,c,head[u]},head[u] = etot;
		e[++etot] = (Edge){v,u,0,-c,head[v]},head[v] = etot;
	}
	void mcmf(int s,int t){
		while (1){
			memset(dis,63,sizeof(dis));
			dis[s] = 0,inq[s] = 1,q.push(s);
			while (!q.empty()){
				int u = q.front();q.pop(),inq[u] = 0;
				for (int i = head[u];i;i = e[i].nxt){
					int v = e[i].v;
					if (e[i].w > 0 && dis[u] + e[i].c < dis[v]){
						dis[v] = dis[u] + e[i].c,fr[v] = i;
						if (!inq[v]) q.push(v),inq[v] = 1;
					}
				}
			}
			if (dis[t] >= INF) return ;
			int w = INF;
			for (int i = fr[t];i;i = fr[e[i].u]) w = min(w,e[i].w);
			ans += w;
			for (int i = fr[t];i;i = fr[e[i].u]) e[i].w -= w,e[i ^ 1].w += w,cost += w * e[i].c;
		}
	}
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	// freopen("out.out","w",stdout);
#endif
	n = read(),m = read();
	for (int i = 1;i <= m;i++){
		int u = read(),v = read(),w = read(),c = read();
		f::adde(u,v,w,c);
	}
	f::mcmf(1,n);
	printf("%d %d\n",f::ans,f::cost);
	return 0;
}