#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5, L = 30;
const int INF = 1e9 + 5;
int n, m, q;
int low[N], dfn[N], timer = 0;
int to[N][L];
int sum[N][L];
int dep[N];
int dis[N];
int p[N];
int biconnected = 0;
vector<int> adj[N];
vector<pair<int, int> > tree[N];
vector<pair<int, int> > S;
vector<pair<int, pair<int, int> > > edges;
void dfs(int u, int p) {
  low[u] = dfn[u] = ++timer;
  int children = 0;
  for (int v : adj[u]) {
    if (dfn[v] == 0) {
      children++;
      S.push_back({u, v});
      dfs(v, u);
      low[u] = min(low[u], low[v]);
      if (((u == 1) && (children > 1)) || ((u > 1) && (dfn[u] <= low[v]))) {
        biconnected++;
        int bi_v = biconnected + n + 1;
        while (S.back().first != u || S.back().second != v) {
          edges.push_back({1, {S.back().first, bi_v}});
          edges.push_back({1, {S.back().second, bi_v}});
          S.pop_back();
        }
        edges.push_back({1, {S.back().first, bi_v}});
        edges.push_back({1, {S.back().second, bi_v}});
        S.pop_back();
      }
    } else if (v != p) {
      low[u] = min(low[u], dfn[v]);
      if (dfn[u] > dfn[v]) {
        S.push_back({u, v});
      }
    }
  }
}
int get(int x) { return x == p[x] ? x : p[x] = get(p[x]); }
bool join(int x, int y) {
  x = get(x);
  y = get(y);
  if (x == y) return false;
  if (rand() & 1) swap(x, y);
  p[x] = y;
  return true;
}
void dfs_tree(int u, int p, int d) {
  to[u][0] = p;
  sum[u][0] = d;
  dep[u] = 1 + dep[p];
  for (pair<int, int> T : tree[u]) {
    int v = T.second;
    int w = T.first;
    if (v != p) dfs_tree(v, u, w);
  }
}
int SUM(int u, int v) {
  int ret = 0;
  if (u == v) return ret;
  if (dep[u] < dep[v]) swap(u, v);
  int k = dep[u] - dep[v];
  for (int i = 0; i < L; i++) {
    if (k & (1 << i)) {
      ret += sum[u][i];
      u = to[u][i];
    }
  }
  if (u == v) return ret;
  for (int i = L - 1; i >= 0; i--) {
    if (to[u][i] != to[v][i]) {
      ret += sum[u][i] + sum[v][i];
      u = to[u][i];
      v = to[v][i];
    }
  }
  return ret + sum[u][0] + sum[v][0];
}
void solve() {
  scanf("%d %d %d", &n, &m, &q);
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    if (v < u) swap(u, v);
    adj[u].push_back(v);
    adj[v].push_back(u);
    edges.push_back({2, {u, v}});
  }
  dfs(1, 0);
  biconnected++;
  while (S.size() > 0) {
    int bi_v = biconnected + n + 1;
    edges.push_back({1, {S.back().first, bi_v}});
    edges.push_back({1, {S.back().second, bi_v}});
    S.pop_back();
  }
  for (int i = 0; i < N; i++) p[i] = i;
  sort(edges.begin(), edges.end());
  for (pair<int, pair<int, int> > E : edges) {
    int w = E.first;
    int u = E.second.first;
    int v = E.second.second;
    if (join(u, v)) {
      tree[u].push_back({w, v});
      tree[v].push_back({w, u});
    }
  }
  dfs_tree(1, 0, 0);
  for (int j = 1; j < L; j++) {
    for (int i = 1; i <= n; i++) {
      to[i][j] = to[to[i][j - 1]][j - 1];
      sum[i][j] = sum[i][j - 1] + sum[to[i][j - 1]][j - 1];
    }
  }
  while (q--) {
    int u, v;
    scanf("%d %d", &u, &v);
    printf("%d\n", SUM(u, v) / 2);
  }
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
