#include<iostream>
#include<vector>
#include<stack>
#include<array>

using namespace std;

vector<vector<int>> g , g2;
vector<int> e , l , ti , z;
stack<int> s;
vector<bool> cp , vis , h;
vector<vector<int>> b;
int t = 0 , v = 0;

void dfs(int p , int q){
    ti[p] = t++;
    l[p] = ti[p];
    s.push(p);
    int c = 0;
    for(int x : g[p]){
        if(x == q)continue;
        if(l[x] == -1){
            c++;
            dfs(x , p);
            if(ti[p] <= l[x]){
                b.push_back({});
                b.back().push_back(p);
                g2.push_back({});
                
                if(p != 0)cp[p] = true;
                e[p] = b.size()-1;
                while(s.top() != p){
                    b.back().push_back(s.top());
                    e[s.top()] = b.size()-1;
                    if(s.top() == x){
                        s.pop();
                        break;
                    }
                    s.pop();
                }
                z.push_back(b.back().size()-2);
            }
            l[p] = min(l[p] , l[x]);
        }else{
            l[p] = min(l[p] , ti[x]);
        }
    }
    if(p == 0 && c > 2)cp[0] = true;
}

vector<array<int , 22>> bl;
vector<int> o , f;

void blH(int p , int q){
    //cout << p << " " << q << endl;
    bl[p][0] = q;
    for(int i = 1 ; i < 22; i++){
        if(bl[p][i-1] != -1)bl[p][i] = bl[bl[p][i-1]][i-1];else bl[p][i] = -1;
    }
    for(int x : g2[p]){
        if(x == q)continue;
        o[x] = o[p]+z[x];
        f[x] = f[p]+1;
        blH(x , p);
    }
}

void qu(int a , int b){
    int w = cp[a-1] + cp[b-1];
    a = e[a-1];
    b = e[b-1];
    int ans = o[a]+o[b];
    if(f[a] < f[b])swap(a , b);
    int r = f[a]-f[b];
    for(int i = 0; i < 22; i++){
        if(r&(1<<i)){
            a = bl[a][i];
        }
    }
    if(a != b){
        for(int i = 21; i >= 0; i++){
            if(bl[a][i] != bl[b][i]){
                a = bl[a][i];
                b = bl[b][i];
            }
        }
        a = bl[a][0];
    }
    cout << (ans-2*o[a]+z[a]-w) << "\n";
}

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int n , m , k;cin >> n >> m >> k;
    g.resize(n);
    e.resize(n , -1);
    ti.resize(n);
    l.resize(n , -1);
    cp.resize(n , false);
    vis.resize(n , false);
    h.resize(n , false);
    for(int i = 0; i < m; i++){
        int a , b;cin >> a >> b;
        g[a-1].push_back(b-1);
        g[b-1].push_back(a-1);
    }
    dfs(0 , -1);
    int u = b.size();
    for(int i  = 0 ; i < n; i++){
        if(cp[i]){
            e[i] = u++;
            g2.push_back({});
            z.push_back(1);
        }
    }
    for(int i = 0; i < b.size(); i++){
        for(int x:b[i]){
            if(cp[x]){
                g2[i].push_back(e[x]);
                g2[e[x]].push_back(i);
            }
        }
    }
    bl.resize(u);
    o.resize(u , 0);
    f.resize(u , 0);
    blH(0 , -1);
    for(int i = 0; i < k; i++){
        int a , b;cin >> a >> b;
        qu(a , b);
    }
}