import java.util.Scanner

import scala.collection.Searching._
import scala.annotation.tailrec
import scala.collection.immutable.Queue

class IUnionFind(val size: Int) {

  private case class Node(var parent: Option[Int], var treeSize: Int)

  private val nodes = Array.fill[Node](size)(new Node(None, 1))

  def union(t1: Int, t2: Int): IUnionFind = {
    if (t1 == t2) return this

    val root1 = root(t1)
    val root2 = root(t2)
    if (root1 == root2) return this

    val node1 = nodes(root1)
    val node2 = nodes(root2)

    if (node1.treeSize < node2.treeSize) {
      node1.parent = Some(t2)
      node2.treeSize += node1.treeSize
    } else {
      node2.parent = Some(t1)
      node1.treeSize += node2.treeSize
    }
    this
  }

  def connected(t1: Int, t2: Int): Boolean = t1 == t2 || root(t1) == root(t2)

  @tailrec
  private def root(t: Int): Int = nodes(t).parent match {
    case None => t
    case Some(p) => root(p)
  }
}


object Main {
  def solve(sc: => Scanner): Unit = {
    val M, C, N = sc.nextInt
    if (M != 0 && C != 0 && N != 0) {
      val A = Array.fill(N)(Array.fill(sc.nextInt)(sc.nextInt))
      var B = List.fill(0)(0)
      for (j <- 0 until 100) {
        for (i <- 0 until N) {
          if (j < A(i).size) {
            B = B :+ A(i)(j)
          }
        }
      }

      val que = Array.fill[Queue[Int]](M)(Queue[Int]())
      var ans = 0
      for (x <- B) {
        var findpoint = M
        for (i <- 0 until M) {
          val findindex = que(i).indexOf(x)
          if (findindex != -1) {
            que(i) = que(i).take(findindex - 1) ++ que(i).drop(findindex + 1)
            //println(findindex)
            //println(que(i).take(findindex - 1))
            // println(que(i).drop(findindex + 1))
            findpoint = i
          }
        }
        System.gc()
        ans += findpoint + 1
        var returnpoint = M
        for (i <- 0 until M) {
          if (que(i).size < C) {
            returnpoint = math.min(returnpoint, i)
          }
        }
        ans += returnpoint + 1
        //println("--", ans)
        if (returnpoint == 0) {
          que(0) ++= List(x)
        } else {
          var returnpoint2 = M
          for (i <- 0 until M) {
            if (que(i).size + (if (returnpoint == i) (1) else (0)) + 1 <= C) {
              returnpoint2 = math.min(returnpoint2, i)
            }
          }
          if (returnpoint != 0) {
            ans += 1 + returnpoint2 + 1
            //println("--",ans)
            val first = que(0).head
            que(0) = que(0).drop(1)
            if (returnpoint2 != M) {
              que(returnpoint2) ++= List(first)
            }
          }
          que(0) ++= List(x)
          ans += 1 + returnpoint+1
          //println("--",ans,returnpoint)
        }
        //println(que.mkString(" "))
        //println(ans)
      }
      println(ans)
      solve(sc)
    }
  }

  def main(args: Array[String]): Unit = {
    val sc: Scanner = new Scanner(System.in)

    solve(sc)
  }

}