import java.util.*
import kotlin.collections.ArrayList
import kotlin.collections.HashMap

/*
6 3 5
1 5
3 4
1 6
2 4 1
3 3 1 5
3 3 4 5
4 5 2 4 3
2 6 2
 */
fun main() {
    val (n, m, q) = readln().split(" ").map { it.toInt() }
    val sw = List(m) { readln().split(" ").map { it.toInt() - 1 } }
    val qs = List(q) { readln().split(" ").map { it.toInt() }.drop(1) }
    val ans = IntArray(q) { -1 }
    data class P(val a: Int, val b: Int)
    val ps = HashMap<P, LinkedList<Int>>()
    for (i in 0..<q) {
        val b = qs[i]
        val k = b.size
        if (k == 1) ans[i] = 0
        for (j in 0..<k - 1) {
            val p = P(b[j], b[j + 1])
            ps.getOrPut(p) { LinkedList<Int>() }.add(i)
        }
    }
    val c = IntArray(q)
    var done = 0
    fun count(a: Int, b: Int, d: Int) {
        val p = P(a, b)
        val pl = ps[p]
        if (pl != null) {
            val it = pl.iterator()
            while (it.hasNext()) {
                val i = it.next()
                c[i] += d
                if (c[i] == qs[i].size - 1) {
                    ans[i] = done
                    it.remove()
                }
            }
        }
    }
    val a = IntArray(n) { it + 1 }
    for (i in 1..n - 1) {
        count(i, i + 1, 1)
    }
    fun update(i: Int, d: Int) {
        if (i > 0) count(a[i - 1], a[i], d)
        if (i < n - 1) count(a[i], a[i + 1], d)
    }
    for ((i, j) in sw) {
        done++
        update(i, -1)
        update(j, -1)
        a[i] = a[j].also { a[j] = a[i] }
        update(i, 1)
        update(j, 1)
    }
    println(ans.joinToString("\n"))
}