#include <bits/stdc++.h>
using namespace std;
#define Zeoy std::ios::sync_with_stdio(false), std::cin.tie(0), std::cout.tie(0)
#define all(x) (x).begin(), (x).end()
#define rson id << 1 | 1
#define lson id << 1
#define int long long
#define mpk make_pair
#define endl '\n'
typedef unsigned long long ULL;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-9;
const int N = 1e5 + 10, M = 4e5 + 10;

int n, m, q, fa[N], dep[N], dp[N][20], st[N];
int mp[N], idx, dis[210][N];
vector<array<int, 3>> edge;
vector<int> g[N], G[N];

int find(int x)
{
    return x == fa[x] ? x : fa[x] = find(fa[x]);
}

void dfs(int u, int par)
{
    dep[u] = dep[par] + 1;
    dp[u][0] = par;
    for (int i = 1; i <= 20; ++i)
        dp[u][i] = dp[dp[u][i - 1]][i - 1];
    for (auto v : g[u])
    {
        if (v == par)
            continue;
        dfs(v, u);
    }
}

int lca(int u, int v)
{
    if (dep[u] < dep[v])
        swap(u, v);
    for (int i = 20; i >= 0; --i)
    {
        if (dep[dp[u][i]] >= dep[v])
            u = dp[u][i];
    }
    if (u == v)
        return u;
    for (int i = 20; i >= 0; --i)
    {
        if (dp[u][i] != dp[v][i])
        {
            u = dp[u][i];
            v = dp[v][i];
        }
    }
    return dp[u][0];
}

void bfs(int id, int st)
{
    dis[id][st] = 0;
    vector<int> vis(n + 10);
    queue<int> q;
    q.push(st);
    vis[st] = true;
    while (q.size())
    {
        int u = q.front();
        q.pop();
        for (auto v : G[u])
        {
            if (!vis[v])
            {
                vis[v] = true;
                dis[id][v] = dis[id][u] + 1;
                q.push(v);
            }
        }
    }
}

void solve()
{
    cin >> n >> m >> q;
    for (int i = 1; i <= n; ++i)
        fa[i] = i;
    for (int i = 1; i <= m; ++i)
    {
        int u, v;
        cin >> u >> v;
        edge.push_back({u, v, i});
        G[u].push_back(v);
        G[v].push_back(u);
    }
    int rt = 0;
    for (auto [x, y, id] : edge)
    {
        int fx = find(x), fy = find(y);
        if (fx != fy)
        {
            fa[fx] = fy;
            g[x].push_back(y);
            g[y].push_back(x);
            rt = x;
            st[id] = true;
        }
    }
    dfs(rt, 0);
    for (int i = 1; i <= m; ++i)
    {
        if (!st[i])
        {
            auto [u, v, id] = edge[i - 1];
            if (!mp[u])
            {
                mp[u] = ++idx;
                bfs(idx, u);
            }
            if (!mp[v])
            {
                mp[v] = ++idx;
                bfs(idx, v);
            }
        }
    }
    while (q--)
    {
        int u, v;
        cin >> u >> v;
        if (n == 1)
        {
            cout << 0 << endl;
            continue;
        }
        int LCA = lca(u, v);
        int ans = dep[u] + dep[v] - 2 * dep[LCA];
        for (int i = 1; i <= idx; ++i)
            ans = min(ans, dis[i][u] + dis[i][v]);
        cout << ans << endl;
    }
}
signed main(void)
{
    Zeoy;
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
    return 0;
}