#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, m, q, tp, nn, tt, dep[N], dfn[N], low[N], stk[N], fa[25][N];
vector<int> g[N], gg[N];
void tarjan(int x, int p) {
  dfn[x] = low[x] = ++tt;
  stk[++tp] = x;
  for (int i = 0; i < g[x].size(); i++)
    if (g[x][i] != p) {
      int y = g[x][i];
      if (!dfn[y]) {
        tarjan(y, x), low[x] = min(low[x], low[y]);
        if (low[y] >= dfn[x]) {
          nn++;
          while (stk[tp] != y)
            gg[nn].push_back(stk[tp]), gg[stk[tp]].push_back(nn), tp--;
          gg[nn].push_back(y), gg[y].push_back(nn);
          tp--;
          gg[nn].push_back(x), gg[x].push_back(nn);
        }
      } else
        low[x] = min(low[x], dfn[y]);
    }
}
void dfs(int x, int p) {
  dep[x] = dep[p] + 1;
  fa[0][x] = p;
  for (int i = 0; i < gg[x].size(); i++)
    if (gg[x][i] != p) dfs(gg[x][i], x);
}
int lca(int u, int v) {
  if (dep[u] < dep[v]) swap(u, v);
  int sub = dep[u] - dep[v];
  for (int i = 0; i <= 20; i++)
    if (sub >> i & 1) u = fa[i][u];
  if (u == v) return u;
  for (int i = 20; i >= 0; i--)
    if (fa[i][u] != fa[i][v]) u = fa[i][u], v = fa[i][v];
  return fa[0][u];
}
int main() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1, u, v; i <= m; i++) {
    scanf("%d%d", &u, &v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  nn = n;
  tarjan(1, 0);
  dfs(1, 0);
  for (int i = 1; i <= 20; i++)
    for (int j = 1; j <= nn; j++) fa[i][j] = fa[i - 1][fa[i - 1][j]];
  while (q--) {
    int u, v;
    scanf("%d%d", &u, &v);
    printf("%d\n", (dep[u] + dep[v] - dep[lca(u, v)] * 2) / 2);
  }
  return 0;
}
