object Main {
  def main(args: Array[String]): Unit = {
    val s = new Main()
    s.solve()
    s.out.flush()
  }
}

class Main {
  import java.io._
  import java.util.StringTokenizer

  import scala.collection.mutable
  import scala.util.Sorting
  import math.{abs, max, min}
  import mutable.{ArrayBuffer, ListBuffer}
  import scala.reflect.ClassTag

  val MOD = 1000000007
  val out = new PrintWriter(System.out)

  def solve(): Unit = {
    val Height, Width, N = ni()
    val (x, y) = na2(N, -1)

    val diagonals = mutable.Map[Int, ArrayBuffer[Int]]()
    REP(N) { i =>
      val id = x(i) - y(i)
      if (id >= 0) {
        if (!diagonals.contains(id)) diagonals += id -> ArrayBuffer()
        diagonals(id) += x(i)
      }
    }

    def findMinGt(as: ArrayBuffer[Int], x: Int): Option[Int] = {
      var ms = 1e9.toInt
      REP(as.length) { i =>
        if (as(i) > x) ms = min(ms, as(i))
      }
      if (ms == 1e9.toInt) None else Some(ms)
    }

    /**
      * x => yの上限
      */
    def createFn: Int => Int = {
      val buff = ArrayBuffer[Int]()
      var p = 0
      var cur = 0

      while(cur < Height) {
        if (diagonals.contains(p)) {
          val D = diagonals(p)
          findMinGt(D, cur) match {
            case Some(next) =>
              buff += next
              p += 1
              cur = next

            case None =>
              cur = Height
          }

        } else {
          cur = Height
        }
      }

      val obstacles = buff.toArray

      x => {
        val cntObs = upperBound(obstacles, x) // xまでが何個あるのか
        min(Width, x - cntObs)
      }
    }

    val f = createFn

    var ans = Height
    REP(N) { i =>
      if (x(i) > 0) {
        val y0Lim = f(x(i) - 1) // １手前のYの上限
        if (y0Lim >= y(i)) { // １手前でこの場所の真上になることができる
          ans = min(ans, x(i)) // 0から何個進んだ離れた場所でぶつかった == 高橋くんの手数
        }
      }
    }

    out.println(ans)
  }

  // 要はcountLe
  // a > x  [x-2, x-1, x, x, x, x+1] の 5
  def upperBound(a: Array[Int], x: Int): Int = {
    def step(l: Int, h: Int): Int = {
      if (h - l == 1) h
      else {
        val mid = (l + h) / 2
        if (a(mid) > x) step(l, mid)
        else step(mid, h)
      }
    }

    step(-1, a.length)
  }

  class InputReader(val stream: InputStream) {
    private val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    private var tokenizer: StringTokenizer = _

    def next(): String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = next().toInt
    def nextLong(): Long = next().toLong
    def nextChar(): Char = next().charAt(0)
  }
  val sc = new InputReader(System.in)
  def ni(): Int = sc.nextInt()
  def nl(): Long = sc.nextLong()
  def nc(): Char = sc.nextChar()
  def ns(): String = sc.next()
  def ns(n: Int): Array[Char] = ns().toCharArray
  def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset)
  def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = {
    val A1, A2 = Array.ofDim[Int](n)
    REP(n) { i =>
      A1(i) = ni() + offset
      A2(i) = ni() + offset
    }
    (A1, A2)
  }
  def nm(n: Int, m: Int): Array[Array[Int]] = {
    val A = Array.ofDim[Int](n, m)
    REP(n) { i =>
      REP(m) { j =>
        A(i)(j) = ni()
      }
    }
    A
  }
  def nal(n: Int): Array[Long] = map(n)(_ => nl())
  def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m))
  def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = offset
    val N = n + offset
    while(i < N) { f(i); i += 1 }
  }
  def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = n - 1 + offset
    while(i >= offset) { f(i); i -= 1 }
  }

  def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = {
    val res = Array.ofDim[A](n)
    REP(n)(i => res(i) = f(i + offset))
    res
  }


  def sumL(as: Array[Int]): Long = {
    var s = 0L
    REP(as.length)(i => s += as(i))
    s
  }

  def cumSum(as: Array[Int]) = {
    val cum = Array.ofDim[Long](as.length + 1)
    REP(as.length) { i =>
      cum(i + 1) = cum(i) + as(i)
    }
    cum
  }
}

Measured memory_bytes: 83024