// Sea, You & Me
#include<bits/stdc++.h>
#define LL long long
#define DB double
#define MOD 1000000007
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) ((-x) & x)
#define MP make_pair
#define MT make_tuple
#define VI vector<int>
#define VL vector<LL>
#define VII VI::iterator
#define VLI VL::iterator
#define all(x) x.begin(), x.end()
#define EB emplace_back
#define PII pair<int, int>
#define SI set<int>
#define SII SI::iterator
#define fi first
#define se second
using namespace std;
template<typename T> void chkmn(T &a, const T b) { (a > b) && (a = b); }
template<typename T> void chkmx(T &a, const T b) { (a < b) && (a = b); }
void Inc(int &a, const int &b) { ((a += b) >= MOD) && (a -= MOD); }
void Dec(int &a, const int &b) { ((a -= b) < 0) && (a += MOD); }
void Mul(int &a, const int &b) { a = 1LL * a * b % MOD; }
void Sqr(int &a) { a = 1LL * a * a % MOD; }
int inc(const int &a, const int &b) { return (a + b >= MOD) ? a + b - MOD : a + b; }
int dec(const int &a, const int &b) { return (a - b < 0) ? a - b + MOD : a - b; }
int mul(const int &a, const int &b) { return 1LL * a * b % MOD; }
int sqr(const int &a) { return 1LL * a * a % MOD; }
int qwqmi(int x, int k = MOD - 2)
{
	int res = 1;
	while(k)
	{
		if(k & 1) Mul(res, x);
		k >>= 1, Sqr(x);
	}
	return res;
}
template<typename T> void read(T &x)
{
	x = 0;
	int f = 1;
	char ch = getchar();
	while(!isdigit(ch))
	{
		if(ch == '-')
			f = -1;
		ch = getchar();
	}
	while(isdigit(ch))
	{
		x = (x << 1) + (x << 3) + (ch ^ 48);
		ch = getchar();
	}
	x = x * f;
}
const int N = 405;
const int M = 1.5e4 + 5;
const int INF = INT_MAX;
int n, m, Start, End;
struct Lexington
{
	int e, ne, cap, cost;
};
struct Noshiro
{
	int idx = 1, h[N];
	Lexington lxt[M << 1];
	void clear()
	{
		idx = 1;
		memset(h, 0, sizeof(h));
	}
	void add(int x, int y, int cap, int cost)
	{
		lxt[++idx] = (Lexington){y, h[x], cap, cost};
		h[x] = idx;
	}
	void adds(int x, int y, int cap, int cost)
	{
		add(x, y, cap, cost);
		add(y, x, 0, -cost);
	}
}nsr;
namespace Dinic
{
	int cur[N];
	int vis[N];
	int dist[N];
	queue<int> q;
	int ansflow = 0, anscost = 0;
	bool bfs()
	{
		for(int i = 1; i <= n; ++i)
		{
			vis[i] = 0;
			dist[i] = INF;
			cur[i] = nsr.h[i];
		}
		while(!q.empty()) q.pop();
		q.push(Start), vis[Start] = 1, dist[Start] = 0;
		while(!q.empty())
		{
			int u = q.front(); q.pop(), vis[u] = 0;
			for(int i = nsr.h[u]; i; i = nsr.lxt[i].ne)
			{
				int v = nsr.lxt[i].e;
				if(dist[v] > dist[u] + nsr.lxt[i].cost && nsr.lxt[i].cap)
				{
					dist[v] = dist[u] + nsr.lxt[i].cost;
					if(!vis[v]) q.push(v), vis[v] = 1;
				}
			}
		}
		return dist[End] != INF;
	}	
	int dfs(int u, int flow)
	{
		if(u == End) return flow;
		int sum = 0; vis[u] = 1;
		for(int &i = cur[u]; i; i = nsr.lxt[i].ne)
		{
			int v = nsr.lxt[i].e;
			if(!vis[v] && dist[v] == dist[u] + nsr.lxt[i].cost && nsr.lxt[i].cap)
			{
				int sav = dfs(v, min(flow, nsr.lxt[i].cap));
				if(sav)
				{
					nsr.lxt[i].cap -= sav;
					nsr.lxt[i ^ 1].cap += sav;
					flow -= sav, sum += sav;
					anscost += sav * nsr.lxt[i].cost;
					if(!flow) return sum;
				}
				else dist[v] = -1;
			}
		}
		vis[u] = 0;
		return sum;
	}
	void get_ans()
	{
		ansflow = 0;
		while(bfs())
			ansflow += dfs(Start, INF);
	}
};
int main()
{
	read(n), read(m);
	Start = 1, End = n;
	nsr.clear();
	for(int i = 1; i <= m; ++i)
	{
		int x, y, z, w;
		read(x), read(y), read(z), read(w);
		nsr.adds(x, y, z, w);
	}
	Dinic::get_ans();
	printf("%d %d\n", Dinic::ansflow, Dinic::anscost);
	return 0;
}