#include <bits/stdc++.h>
using namespace std;
const int maxn = int(1e6) + 100;
struct LINK {
  int id, next;
};
int n, m, Q, color_sum;
int now, ti;
vector<pair<int, int> > que[maxn];
int h[maxn];
LINK t[maxn];
int dfn[maxn], low[maxn];
int answer[maxn], f[maxn];
int fa[maxn], dsu[maxn];
vector<int> color[maxn];
bool vis[maxn];
stack<int> stk;
void join(int u, int v) {
  t[now].id = v;
  t[now].next = h[u];
  h[u] = now++;
  t[now].id = u;
  t[now].next = h[v];
  h[v] = now++;
}
void read() {
  scanf("%d%d%d", &n, &m, &Q);
  for (int i = 1; i <= n; ++i) h[i] = -1;
  for (int i = 1; i <= m; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    join(u, v);
  }
  for (int i = 1; i <= Q; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    que[x].push_back(make_pair(y, i));
    if (x != y) que[y].push_back(make_pair(x, i));
  }
}
void tarjan(int cur) {
  dfn[cur] = low[cur] = ++ti;
  vis[cur] = true;
  for (int i = h[cur]; i > -1; i = t[i].next)
    if (vis[t[i].id])
      low[cur] = min(low[cur], dfn[t[i].id]);
    else {
      stk.push(i);
      tarjan(t[i].id);
      low[cur] = min(low[cur], low[t[i].id]);
      if (low[t[i].id] >= dfn[cur]) {
        ++color_sum;
        while (stk.top() != i) {
          color[color_sum].push_back(t[stk.top()].id);
          color[color_sum].push_back(t[stk.top() ^ 1].id);
          stk.pop();
        }
        color[color_sum].push_back(t[stk.top()].id);
        color[color_sum].push_back(t[stk.top() ^ 1].id);
        stk.pop();
      }
    }
}
int dsu_find(int cur) {
  return (dsu[cur] < 0 ? cur : dsu[cur] = dsu_find(dsu[cur]));
}
void merge(int x, int y) {
  x = dsu_find(x);
  y = dsu_find(y);
  dsu[x] = y;
}
void dfs(int cur) {
  vis[cur] = true;
  for (auto &i : que[cur])
    if (vis[i.first]) {
      int v = i.first;
      int id = i.second;
      answer[id] = f[v] + f[cur] - f[dsu_find(v)] * 2;
    }
  for (int i = h[cur]; i > -1; i = t[i].next)
    if (!vis[t[i].id]) {
      fa[t[i].id] = cur;
      f[t[i].id] = f[cur] + 1;
      dfs(t[i].id);
    }
  merge(cur, fa[cur]);
}
void solve() {
  tarjan(1);
  now = 0;
  for (int i = 1; i <= n + color_sum; ++i) h[i] = -1;
  for (int i = 1; i <= color_sum; ++i) {
    sort(color[i].begin(), color[i].end());
    auto it = unique(color[i].begin(), color[i].end());
    color[i].resize(distance(color[i].begin(), it));
    for (auto &j : color[i]) join(n + i, j);
  }
  for (int i = 0; i <= n + color_sum; ++i)
    dsu[i] = -1, f[i] = 0, vis[i] = false;
  dfs(1);
  for (int i = 1; i <= n + color_sum; ++i) assert(vis[i]);
  for (int i = 1; i <= Q; ++i) printf("%d\n", answer[i] >> 1);
}
int main() {
  read();
  solve();
  return 0;
}
