#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
const int lg = 18;
vector<int> g1[N + 10], g2[N + 10];
vector<vector<int> > cyc;
int vis[N + 10], taken[N + 10], pre[N + 10];
int par[N + 10][lg];
void dfs(int v, int p, int d) {
  vis[v] = d;
  for (auto it : g2[v]) {
    if (it != p) {
      par[it][0] = v;
      dfs(it, v, d + 1);
    }
  }
}
int findLca(int u, int v) {
  if (vis[u] > vis[v]) {
    for (int j = lg - 1; j >= 0; j--) {
      int trial = par[u][j];
      if (vis[trial] >= vis[v]) {
        u = trial;
      }
    }
  } else {
    for (int j = lg - 1; j >= 0; j--) {
      int trial = par[v][j];
      if (vis[trial] >= vis[u]) {
        v = trial;
      }
    }
  }
  if (u == v) {
    return v;
  }
  for (int j = lg - 1; j >= 0; j--) {
    if (par[u][j] != par[v][j]) {
      u = par[u][j];
      v = par[v][j];
    }
  }
  return par[v][0];
}
int main() {
  int n, m, Q;
  scanf("%d%d%d", &n, &m, &Q);
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    g1[u].push_back(v);
    g1[v].push_back(u);
  }
  queue<int> q;
  vis[1] = 1;
  q.push(1);
  int node = n;
  while (!q.empty()) {
    int fr = q.front();
    q.pop();
    if (taken[fr]) {
      for (auto it : g1[fr]) {
        if (!vis[it]) {
          pre[it] = fr;
          vis[it] = 1;
          q.push(it);
        }
      }
    } else {
      bool flag = false;
      for (auto it : g1[fr]) {
        if (it == pre[fr]) {
          continue;
        }
        if (!vis[it]) {
          pre[it] = fr;
          vis[it] = 1;
          q.push(it);
        } else {
          if (flag == false) {
            cyc.emplace_back();
            flag = true;
          }
          cyc.back().push_back(it);
          taken[it] = 1;
        }
      }
      if (fr == 1) {
        continue;
      }
      if (!flag) {
        ++node;
        g2[pre[fr]].push_back(node);
        g2[fr].push_back(node);
        g2[node].push_back(pre[fr]);
        g2[node].push_back(fr);
      } else {
        cyc.back().push_back(pre[fr]);
        cyc.back().push_back(fr);
      }
    }
  }
  for (auto i : cyc) {
    ++node;
    for (auto j : i) {
      g2[j].push_back(node);
      g2[node].push_back(j);
    }
  }
  memset(vis, 0, sizeof vis);
  vis[0] = -1;
  dfs(1, 0, 0);
  for (int j = 1; j < lg; j++) {
    for (int i = 1; i <= node; i++) {
      par[i][j] = par[par[i][j - 1]][j - 1];
    }
  }
  while (Q--) {
    int a, b;
    scanf("%d%d", &a, &b);
    int lca = findLca(a, b);
    printf("%d\n", (vis[a] + vis[b] - 2 * vis[lca]) / 2);
  }
}
