package main

import (
    "fmt"
)
type Node struct {
    index int
    child []Node
    //child []int
    mark string
    f []string
}

//var count int = 0

func dfs(graph []*Node, v Node, m int, count int){
    fmt.Println(v.index)
    v.mark = "gray"
    v.index = count
    count++
    for i:= 0; i < m; i++{
        if v.child[i].mark == "white"{
            dfs(graph, v.child[i], m, count)
        }
    }
    v.mark = "black"
}

func main() {
    var (
        n, m, q         int
        M               [][]int
        S               [][]string
        value          int
        letter         string
        graph          []*Node
        count          int
    )

    fmt.Scan(&n, &m, &q)
    graph = make([] *Node, n)
    for i:= 0; i < n; i++{
        graph[i].index = i
        graph[i].mark = "white"
        graph[i].child = make([] Node, m)
        //graph[i].child = make([] int, m)
        graph[i].f = make([] string, m)
    }
    M = make([][] int, n)
    S = make([][] string, n)
    for i:= 0; i < n; i++{
        for j:= 0; j < m; j++{
            M[i] = make([] int, m)
            S[i] = make([] string, m)
        }
    }
    for i:= 0; i < n; i++{
        for j:= 0; j < m; j++{
            fmt.Scan(&value)
            M[i][j] = value
            graph[i].child[j] = *graph[value]
            //graph[i].child[j] = value
        }
    }
    for i:= 0; i < n; i++{
        for j:= 0; j < m; j++{
            fmt.Scan(&letter)
            S[i][j] = letter
            graph[i].f[j] = letter
        }
    }
    fmt.Println("this")
    for i:= 0; i < n; i++{
        for j:= 0; j < m; j++{
            fmt.Println("i = ", i, "j = ", j, " ", graph[i].child[j].index)
        }
    }
    count = 0
    for i:= 0; i < n; i++{
        if graph[i].mark == "white"{
            dfs(graph, *graph[i], m, count)
        }
        count++
    }
    fmt.Println("NEW solution")
    fmt.Print(n, "\n", m, "\n", 0, "\n")
    for i:= 0; i < n; i++{
        for k:= 0; k < n; k++{
            if graph[k].index == i{
                for l:= 0; l < m; m++{
                    //fmt.Print(graph[k].child[l].index, " ")
                    fmt.Print(graph[k].child[l])
                }
                fmt.Print("\n")
            }
        }
    }
    for i:= 0; i < n; i++{
        for k:= 0; k < n; k++{
            if graph[k].index == i{
                for l:= 0; l < m; m++{
                    fmt.Print(graph[k].f[l], " ")
                }
                fmt.Print("\n")
            }
        }
    }
}