#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
const int oo = 1e9;
int n, m, q, cnt, ver;
int h[N], num[N], low[N], f[N][30];
vector<int> last[N], vi[N];
stack<int> st;
void addeg(int u, int v) {
  vi[u].push_back(v);
  vi[v].push_back(u);
}
void dsf(int pre, int u) {
  num[u] = low[u] = ++cnt;
  st.push(u);
  for (int v : last[u])
    if (v != pre) {
      if (num[v])
        low[u] = min(low[u], num[v]);
      else {
        dsf(u, v);
        low[u] = min(low[u], low[v]);
        if (low[v] >= num[u]) {
          addeg(u, ++ver);
          while (st.top() != v) {
            addeg(st.top(), ver);
            st.pop();
          }
          addeg(st.top(), ver);
          st.pop();
        }
      }
    }
}
void dfs(int pre, int u) {
  f[u][0] = pre;
  for (int v : vi[u])
    if (v != pre) {
      h[v] = h[u] + 1;
      dfs(u, v);
    }
}
int LCA(int u, int v) {
  if (h[u] < h[v]) swap(u, v);
  for (int i = 20; i >= 0; --i)
    if (f[u][i] != -1 && h[f[u][i]] >= h[v]) {
      u = f[u][i];
    }
  for (int i = 20; i >= 0; --i)
    if (f[u][i] != -1 && f[v][i] != -1 && f[u][i] != f[v][i])
      u = f[u][i], v = f[v][i];
  if (u != v) return f[u][0];
  return u;
}
signed main() {
  scanf("%d%d%d", &n, &m, &q);
  ver = n;
  for (int i = 1; i <= m; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    last[u].push_back(v);
    last[v].push_back(u);
  }
  dsf(1, 1);
  memset(f, -1, sizeof f);
  dfs(1, 1);
  for (int i = 1; i <= 20; ++i)
    for (int j = 1; j <= n; ++j)
      if (f[j][i - 1] != -1) f[j][i] = f[f[j][i - 1]][i - 1];
  while (q--) {
    int u, v;
    scanf("%d%d", &u, &v);
    int uv = LCA(u, v);
    printf("%d\n", (h[u] + h[v] - 2 * h[uv]) / 2);
  }
}
