#include<stdio.h>
#include<algorithm>
#include<cstring>
using namespace std;

typedef struct lista
{
    int info;
    lista *next;
} * nod;

nod a[10001];
int i,j,k,m,n,u,l;
bool viz[10001];
int este[10001];

void add(int x, nod &p)
{
    nod r = new lista;
    r->info=x;
    r->next=p;
    p=r;
}


bool dfs(int x)
{
    if (viz[x]==1) return 0;
    viz[x]=0;
    nod r=a[x];
    while (r)
    {
        if (!este[r->info] || dfs(r->info))
        {
            este[r->info]=x;
            return 1;
        }
    r=r->next;
    }
    return 0;
}
int main()
{
    freopen("cuplaj.in","r",stdin);
    freopen("cuplaj.out","w",stdout);
    scanf("%d%d%d",&n,&k,&m);
    for (i=1; i<=m; ++i)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        add(y,a[x]);
    }
    bool ok = true;
    for (i=0; i<n; ++i)
    {
        memset(viz,0,sizeof(viz));
        dfs(i);
    }
    for (i=1; i<=n; ++i)
        if ( !este[i] ) printf("%d %d\n",este[i]+1,i+1);

return 0;
}