//#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define lowbit(x) (x&-x)
using namespace std;
using LL=long long;
const int N=1e5+5;
int n,m,q,f[N],fa[N][20],dep[N];
int dis[201][N],que[N],h,t,vis[N];
set<int> st;
vector<int> e[N],w[N];//e是树边 
int find(int x)
{
	return f[x]==x?x:f[x]=find(f[x]);
}
void dfs(int u,int f)
{
	for (auto v:e[u])
	{
		if (v==f) continue;
		dep[v]=dep[u]+1;
		fa[v][0]=u;
		dfs(v,u);
	}
}
int LCA(int x,int y)
{
	if (dep[x]<dep[y]) swap(x,y);
	int dt=dep[x]-dep[y];
	for (int i=0;i<20;++i)
		if (dt&1) x=fa[x][i];
	if (x==y) return x;
	for (int i=19;i>=0;--i)
		if (fa[x][i]!=fa[y][i])
		{
			x=fa[x][i];
			y=fa[y][i];
		}
	return fa[x][0];
}
void bfs(int id,int st)
{
	h=t=0;
	que[++t]=st;
	memset(vis,0,sizeof(vis));
	vis[st]=1;
	while (h!=t)
	{
		++h;
		for (auto v:w[que[h]])
		{
			if (vis[v]) continue;
			vis[v]=1;
			dis[id][v]=dis[id][que[h]]+1;
			que[++t]=v;
		}
	}
}
int main()
{
//	cin.tie(0);
//	cout.tie(0);
//	ios::sync_with_stdio(0);
	cin>>n>>m>>q;
	for (int i=1;i<=n;++i) f[i]=i;
	for (int i=1,x,y;i<=m;++i)
	{
		cin>>x>>y;
		if (x==y) continue;
		w[x].push_back(y);
		w[y].push_back(x);
		if (find(x)==find(y))
		{
			st.insert(x);
			st.insert(y);
			continue;
		}
		f[f[x]]=f[y];
		e[x].push_back(y);
		e[y].push_back(x);
	}
	dfs(1,0);
	for (int i=0;i<19;++i)
		for (int j=1;j<=n;++j) fa[j][i+1]=fa[fa[j][i]][i];
	int tot=0;
	for (auto v:st) bfs(++tot,v);
	for (int x,y;q--;)
	{
		cin>>x>>y;
		int ans=dep[x]+dep[y]-2*dep[LCA(x,y)];
		for (int i=1;i<=tot;++i)
			ans=min(ans,dis[i][x]+dis[i][y]);
		cout<<ans<<"\n";
	}
	return 0;
}