#include <bits/stdc++.h>
using namespace std;
const int MX = 1e5 + 7;
int n, m, q;
int low[MX], dfn[MX], stk[MX], dsz, ssz, bsz;
int dep[MX << 1], ST[MX << 1][21];
vector<int> E[MX], G[MX << 1];
void tarjan(int u, int fa) {
  dfn[u] = low[u] = ++dsz;
  stk[++ssz] = u;
  for (auto v : E[u]) {
    if (v == fa) continue;
    if (!dfn[v]) {
      tarjan(v, u);
      low[u] = min(low[u], low[v]);
      if (low[v] >= dfn[u]) {
        ++bsz;
        int now;
        do {
          now = stk[ssz--];
          G[bsz].push_back(now);
          G[now].push_back(bsz);
        } while (now != v);
        G[bsz].push_back(u);
        G[u].push_back(bsz);
      }
    } else
      low[u] = min(low[u], dfn[v]);
  }
}
void dfs(int u, int fa, int d) {
  dep[u] = d;
  ST[u][0] = fa;
  for (int i = 1; i <= 20; i++) ST[u][i] = ST[ST[u][i - 1]][i - 1];
  for (auto v : G[u]) {
    if (v == fa) continue;
    dfs(v, u, d + 1);
  }
}
int LCA(int u, int v) {
  while (dep[u] != dep[v]) {
    if (dep[u] < dep[v]) swap(u, v);
    int d = dep[u] - dep[v];
    for (int i = 0; i <= 20; i++)
      if ((d >> i) & 1) u = ST[u][i];
  }
  if (u == v) return u;
  for (int i = 20; i >= 0; i--) {
    if (ST[u][i] != ST[v][i]) {
      u = ST[u][i];
      v = ST[v][i];
    }
  }
  return ST[u][0];
}
void pre_solve() {
  bsz = n;
  tarjan(1, 0);
  dfs(1, 0, 1);
}
int main() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    E[u].push_back(v);
    E[v].push_back(u);
  }
  pre_solve();
  while (q--) {
    int u, v;
    scanf("%d%d", &u, &v);
    int lca = LCA(u, v);
    int ans = dep[u] + dep[v] - 2 * dep[lca];
    ans >>= 1;
    printf("%d\n", ans);
  }
  return 0;
}
