// luogu-judger-enable-o2
// luogu-judger-enable-o2
#include <bits/stdc++.h>
#define F(i, l, r) for(int i = (l), _end_ = (int)(r); i <= _end_; ++i)
#define f(i, r, l) for(int i = (r), _end_ = (int)(l); i >= _end_; --i)
#define Set(a, v) memset(a, v, sizeof(a))
#define file(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout)
using namespace std;

bool chkmin(int &a, int b) {return b < a ? a = b, 1 : 0;}
bool chkmax(int &a, int b) {return b > a ? a = b, 1 : 0;}

inline int read() {
 int x = 0, fh = 1; char ch = getchar();
    for (; !isdigit(ch); ch = getchar() ) if (ch == '-') fh = -1;
    for (; isdigit(ch); ch = getchar() ) x = (x<<1) + (x<<3) + (ch ^ '0');
    return x * fh;
}
int n,m;
long long ans;
int s,t;
int he[5005],to[400005],ne[400005],w[400005],cost[400005],e=1;
int dis[5005];
int cur[5005];
int vis[5005];
void add(int x,int y,int z,int ww){
     to[++e]=y;
	 ne[e]=he[x];
	 he[x]=e;
	 cost[e]=ww;
	 w[e]=z;
}
bool bfs(){
     deque<int>q;
	 F(i,0,n)dis[i]=1e9;
	 Set(vis,0);
	 dis[t]=0;
//	 cerr<<dis[s]<<endl;
	 q.push_back(t);
	 while(!q.empty()){
	     int x=q.front();
		 q.pop_front();
		 for(int i=he[x];i;i=ne[i]){
		     int v=to[i];
			 if(dis[v]>dis[x]-cost[i]&&w[i^1]){
			    dis[v]=dis[x]-cost[i];
				if(!vis[v]){
					vis[v]=1;
				if(!q.empty()&&dis[v]<dis[q.front()])q.push_front(v);
				else q.push_back(v);
				}
			 }
		 }
		 vis[x]=0;
	 }
//	 cerr<<dis[s]<<endl;
	 return dis[s]<1e9;
}
inline int dfs(int u,int low){
   if(u==t){
      vis[t]=1;
      return low;
   }
   int res=0,a;
   vis[u]=1;
   for(int& i=cur[u];i;i=ne[i]){
      int v=to[i];
      if(!vis[v]&&w[i]&&dis[u]-cost[i]==dis[v]){
          a=dfs(v,min(w[i],low-res));
          if(a)ans+=a*cost[i],w[i]-=a,w[i^1]+=a,res+=a;
      }
      if(res==low)break;
   }
   return res;
}
int dinic(){
    int res=0,cnt;
	while(bfs()){
		vis[t]=1;
		//cerr<<++cnt<<endl;
		while(vis[t]){
		Set(vis,0);
		memcpy(cur,he,sizeof(cur));
	    res+=dfs(s,1e9);
		}
		//cerr<<res<<endl;
	}
	return res;
}
int main () {
#ifndef ONLINE_JUDGE
file("a");
#endif
	n=read();
	m=read();
    s=1;
	t=n;
	F(i,1,m){
	   int x=read(),y=read(),z=read(),ww=read();
	   add(x,y,z,ww);
	   add(y,x,0,-ww);
	}
	//cout<<e<<endl;
    printf("%d ",dinic());
	printf("%lld\n",ans);
    return 0;
}