#include <fstream>
#include <vector>
const int NMAX=100005;

using namespace std;

class InParser
{
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch()
    {
        ++sp;
        if (sp == 4096)
        {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume)
    {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n)
    {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-')
        {
            n = 0;
            sgn = -1;
        }
        else
        {
            n = c - '0';
        }
        while (isdigit(c = read_ch()))
        {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};


class OutParser
{
    vector<char> str;
    int ptr;
    ofstream fout;

    void putChar(char chr)
    {
        if (ptr == int(str.size()))
        {
            fout.write(str.data(), str.size());
            ptr = 0;
        }
        str[ptr++] = chr;
    }

    template<class T>
    void putInt(T num)
    {
        if (num < 0)
        {
            putChar('-');
            num *= -1;
        }
        if (num > 9)
            putInt(num / 10);
        putChar(num % 10 + '0');
    }

public:
    OutParser(const char* name) : str(1e5), ptr(0), fout(name) { }
    ~OutParser()
    {
        fout.write(str.data(), ptr);
        fout.close();
    }

    template<class T>
    friend OutParser& operator<<(OutParser& out, const T num)
    {
        out.putInt(num);
        return out;
    }

    friend OutParser& operator<<(OutParser& out, const char chr)
    {
        out.putChar(chr);
        return out;
    }

    friend OutParser& operator<<(OutParser& out, const char* str)
    {
        for (int i = 0; str[i]; i++)
            out.putChar(str[i]);
        return out;
    }
};

InParser fin("cuplaj.in");
OutParser fout("cuplaj.out");

vector <int> v[NMAX];
int cp[NMAX], n, m, ans;
bool viz[NMAX], gasit;

bool cuplaj(int);

int main()
{
    int i, a, b;
    fin>>n>>a>>m;
    for(i=1; i<=m; i++)
    {
        fin>>a>>b;
        b+=n;
        v[a].push_back(b);
    }
    do
    {
        gasit=false;
        for(i=1; i<=n; i++)
        {
            if(!cp[i] && cuplaj(i))
            {
                ans++;
                gasit=true;
            }
        }
        for(i=1; i<=n; i++) viz[i]=false;
    }
    while(gasit);
    fout<<ans<<'\n';
    for(i=1; i<=n; i++)
    {
        if(cp[i]) fout<<i<<' '<<cp[i]-n<<'\n';
    }
    return 0;
}

bool cuplaj(int nod)
{
    if(viz[nod]) return false;
    viz[nod]=true;
    for(auto i:v[nod])
    {
        if(!cp[i])
        {
            cp[i]=nod;
            cp[nod]=i;
            return true;
        }
    }
    for(auto i:v[nod])
    {
        if(cuplaj(cp[i]))
        {
            cp[i]=nod;
            cp[nod]=i;
            return true;
        }
    }
    return false;
}