#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}
const int B = 500;
int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int N,M,Q; cin >> N >> M >> Q;
	using P = pair<int,int>;
	using PP = pair<P,P>;
	V<P> sw(M);
	rep(i,M){
		int x,y; cin >> x >> y; x--,y--;
		sw[i] = P(x,y);
	}
	V<PP> qs;
	rep(i,Q){
		int l,r,x; cin >> l >> r >> x; l--,x--;
		qs.eb(P(l,r),P(i,x));
	}
	sort(all(qs),[&](PP& a,PP& b){
		if(a.fs.fs/B != b.fs.fs/B) return a.fs.fs/B < b.fs.fs/B;
		return a.fs.sc < b.fs.sc;
	});
	V<int> f(N),g(N); iota(all(f),0); iota(all(g),0);
	auto ladd = [&](P p){
		int x = p.fs, y = p.sc;
		swap(g[x],g[y]);
		swap(f[g[x]],f[g[y]]);
	};
	auto radd = [&](P p){
		int x = p.fs, y = p.sc;
		swap(f[x],f[y]);
		swap(g[f[x]],g[f[y]]);
	};
	int L=0,R=0;
	V<int> ans(Q);
	for(auto q: qs){
		int l = q.fs.fs, r = q.fs.sc, id = q.sc.fs, x = q.sc.sc;
		for(;l<L;) ladd(sw[--L]);
		for(;r>R;) radd(sw[R++]);
		for(;l>L;) ladd(sw[L++]);
		for(;r<R;) radd(sw[--R]);
		ans[id] = f[x];
	}
	for(int v: ans) cout << v+1 << endl;
}