#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 5;
const int lg = 20;
vector<int> gr[maxn];
int n, m, q;
int color[maxn];
int tin[maxn], fup[maxn];
bool used[maxn];
int tout[maxn];
int currt = 0, ccol = 0;
vector<pair<int, int> > edges;
set<int> cols[maxn];
vector<int> cgr[maxn];
int h[maxn];
int up[maxn][lg];
int nxt(int v, int i) {
  return v == edges[i].first ? edges[i].second : edges[i].first;
}
void dfs(int v, int par = -1) {
  tin[v] = currt++;
  fup[v] = tin[v];
  for (auto i : gr[v]) {
    int u = nxt(v, i);
    if (i == par) continue;
    if (tin[u] != -1) {
      fup[v] = min(fup[v], tin[u]);
    } else {
      dfs(u, i);
      fup[v] = min(fup[v], fup[u]);
    }
  }
}
void paint(int v, int col, int par) {
  used[v] = true;
  for (auto i : gr[v]) {
    if (i == par) continue;
    int u = nxt(v, i);
    if (!used[u]) {
      if (fup[u] >= tin[v]) {
        int nc = ccol++;
        color[i] = nc;
        paint(u, nc, i);
      } else {
        color[i] = col;
        paint(u, col, i);
      }
    } else if (tin[u] < tin[v]) {
      color[i] = col;
    }
  }
}
void prepare(int v, int pp = -1) {
  tin[v] = currt++;
  if (pp == -1)
    h[v] = 0;
  else
    h[v] = h[pp] + 1;
  if (pp == -1) pp = v;
  up[v][0] = pp;
  for (auto i = 1; i < lg; ++i) up[v][i] = up[up[v][i - 1]][i - 1];
  for (auto u : cgr[v]) {
    if (u == pp) continue;
    prepare(u, v);
  }
  tout[v] = currt++;
}
inline bool ispr(int v, int u) {
  return tin[v] <= tin[u] && tout[v] >= tout[u];
}
inline int lca(int v, int u) {
  if (ispr(v, u)) return v;
  if (ispr(u, v)) return u;
  for (auto i = lg - 1; i >= 0; --i) {
    int w = up[v][i];
    if (!ispr(w, u)) v = w;
  }
  return up[v][0];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> q;
  for (auto i = 0; i < m; ++i) {
    int v, u;
    cin >> v >> u;
    --v;
    --u;
    gr[v].push_back(i);
    gr[u].push_back(i);
    edges.push_back(make_pair(v, u));
  }
  fill(tin, tin + n, -1);
  dfs(0);
  fill(color, color + m, -1);
  paint(0, ccol, -1);
  for (auto i = 0; i < m; ++i) {
    int v = edges[i].first, u = edges[i].second;
    cols[v].insert(color[i]);
    cols[u].insert(color[i]);
  }
  for (auto i = 0; i < n; ++i) {
    for (auto j : cols[i]) {
      cgr[j + n].push_back(i);
      cgr[i].push_back(j + n);
    }
  }
  currt = 0;
  prepare(0);
  for (auto i = 0; i < q; ++i) {
    int v, u;
    cin >> v >> u;
    --v;
    --u;
    int w = lca(v, u);
    int ans = h[v] + h[u] - 2 * h[w];
    cout << ans / 2 << '\n';
  }
}
