#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<math.h>
#include<queue>
using namespace std;
#define inf 0x3f3f3f3f
const int maxn = 10050;
struct Edge
{
int v,f,c; //终点,流量,费用
int next; //邻接表
} edge[maxn];
int n,m,k,op;
int cnt;//边数
int head[maxn],haha[maxn],book[maxn];//邻接表
int d[maxn],ef[maxn],num[maxn],pre[maxn]; //费用,最小流量,存编号,前驱
int sp,tp;//源点,汇点
void add(int u,int v,int f,int c) //存图(正反)
{
edge[cnt].v=v;
edge[cnt].f=f;
edge[cnt].c=c;
edge[cnt].next=head[u];
head[u]=cnt++;
edge[cnt].v=u;
edge[cnt].f=0;
edge[cnt].c=-c;
edge[cnt].next=head[v];
head[v]=cnt++;
}
int spfa()
{
queue <int> q;
memset(d,inf,sizeof(d));
memset(ef,inf,sizeof(ef));
d[sp]=0;
pre[tp]=0;
q.push(sp);
while(!q.empty())
{
int cur=q.front();
book[cur]=0;
q.pop();
// printf("%d^^^\n",cur);
for(int i=head[cur]; i!=-1; i=edge[i].next)
{
int u=edge[i].v;
if(d[cur]+edge[i].c<d[u] && edge[i].f>0)
{
d[u]=d[cur]+edge[i].c; //深度
pre[u]=cur;
num[u]=i;
ef[u]=min(ef[cur],edge[i].f);
if(book[u]==0)
{
book[u]=1;
q.push(u);
}
}
}
}
return pre[tp];
}
int dinic(int sp,int tp) //最大流
{
x=0,y=0; //x是流量,y是费用
while(spfa())
{
x+=ef[tp];
y+=ef[tp]*d[tp];
for (int i = tp ; i != sp ; i = pre[i])
{
//通过前驱找该增广路经过的所有边 然后更新流量 (原路减流量反向弧加流量)
edge[num[i]].f -= ef[tp];
edge[num[i] ^ 1].f+= ef[tp];
}
}
printf("%d %d\n",x,y);
}
int main()
{
while(scanf("%d %d %d",&n,&m,&k)&&(n||m||k))
{
memset(head,-1,sizeof(head));
cnt=0;
int x,y,c,minn=inf,maxx=-inf;
for(int i=1; i<=m; i++)
{
scanf("%d %d",&x,&y);
add(x,y,1,1);
}
sp=1,tp=n;
dinic(sp,tp);
}
return 0;
}