import java.util.Scanner;
import java.util.Arrays;
class Main {
public static void main
(String[] args
) { Scanner kb
= new Scanner
(System.
in);
while(kb.hasNext()) {
int n = kb.nextInt();
int m = kb.nextInt();
int q = kb.nextInt();
int [] nodeIndex = new int[n];
Node [] nodes = new Node[n];
for(int i = 0 ; i < n ; i++) {
nodeIndex[i] = i;
nodes[i] = new Node(i);
}
for(int i = 0; i < m ; i++) {
int a = kb.nextInt() - 1;
int b = kb.nextInt() - 1;
int indexA = nodeIndex[a];
int indexB = nodeIndex[b];
nodes[indexA].next = nodes[indexB];
int currentNode = indexB;
do {
nodeIndex[currentNode] = indexA;
currentNode = nodes[currentNode].next.v;
} while(nodes[currentNode].next != null);
}
for(int i = 0 ; i < q ; i++) {
int a = kb.nextInt() - 1;
int b = kb.nextInt() - 1;
int indexA = nodeIndex[a];
int indexB = nodeIndex[b];
if (a
== b
) System.
out.
println("S"); }
}
}
}
class Node {
int v;
Node next;
Node(int v) {
this.v = v;
}
do {
s += v + " ";
} while(next != null);
return s;
}
}