#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > g, comp, g2;
vector<int> t, l;
vector<bool> c;
stack<int> s;
int tim = 0, k = 0;
void dfs(int v, int pa)
{
    t[v] = l[v] = ++tim;
    s.push(v);
    for(auto x : g[v])
    {
        if(x == pa) continue;
        if(t[x] == 0)
        {
            dfs(x, v);
            l[v] = min(l[v], l[x]);
            if(l[x] < t[v]) continue;
            //cout << x << "\n";
            if(t[v] != 1 || t[x] != 2) c[v] = 1;
            comp.push_back({});
            comp[k].push_back(v);
            while(s.top() != x)
            {
                comp[k].push_back(s.top());
                s.pop();
            }
            comp[k].push_back(x);
            s.pop();
            k++;
        }
        else l[v] = min(l[v], t[x]);
    }
}
vector<int> pref, d;
vector<vector<int> > p;
void dfs2(int v, int pa)
{

    d[v] = d[pa] + 1;
    p[v][0] = pa;
    pref[v] = pref[pa] + (v >= k ? -1 : comp[v].size());
    for(int j = 1; j < 20; j++)
    {
        p[v][j] = p[p[v][j - 1]][j - 1];
    }
    for(auto x : g2[v])
    {
        if(x == pa) continue;
        dfs2(x, v);
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m, q;
    cin >> n >> m >> q;
    g.resize(n + 1);
    t.resize(n + 1);
    l.resize(n + 1);
    c.resize(n + 1);
    for(int i = 0; i < m; i++)
    {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    dfs(1, 0);
    g2.resize(2 * n + 1);
    vector<int> ind(n + 1);
    vector<int> id(n + 1);
    int z = k;
    for(int i = 1; i <= n; i++)
    {
        if(c[i]) ind[i] = z++, id[i] = ind[i];
    }
    for(int i = 0; i < k; i++)
    {
        for(auto x : comp[i])
        {
            if(c[x])
            {
                int pos = ind[x];
                g2[pos].push_back(i);
                g2[i].push_back(pos);
            }
            else id[x] = i;
        }
    }
    pref.resize(2 * n + 1);
    d.resize(2 * n + 1);
    p.resize(2 * n + 1, vector<int>(20));
    dfs2(0, z);
    while(q--)
    {
        int x, y;
        cin >> x >> y;

        int ans = 0;
        if(!c[x]) ans--;
        if(!c[y]) ans--;

        x = id[x];
        y = id[y];
        ans += pref[x] + pref[y];
        if(d[y] < d[x]) swap(x, y);
        int diff = d[y] - d[x];
        for(int j = 0; j < 20; j++)
        {
            if((diff >> j) & 1)
            {
                y = p[y][j];
            }
        }
        for(int j = 19; j >= 0; j--)
        {
            if(p[x][j] != p[y][j])
            {
                x = p[x][j];
                y = p[y][j];
            }
        }
        if(x != y)
        {
            x = p[x][0];

        }
        ans -= pref[x];
        ans -= pref[p[x][0]];
        cout << ans << "\n";
    }
}