import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.lang.AssertionError
import java.util.*
import kotlin.concurrent.fixedRateTimer
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

val MOD = 1_000_000_007L

data class Item(val r: Int, val c: Int, val v: Long)
class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  fun solve() {
    val N = ni()
    val M = ni()
    val K = ni()
    val items = Array(N){LongArray(M)}
    for (i in 0 until K) {
      val r = ni() - 1
      val c = ni() - 1
      val v = nl()
      items[r][c] = v
    }

    val dp = Array(4){Array(N){LongArray(M)} }
    dp[1][0][0] = items[0][0]
    for (r in 0 until N) {
      for (c in 0 until M) {
        if (r - 1 >= 0) {
          var best = 0L
          for (s in 0 .. 3) {
            best = max(best, dp[s][r - 1][c])
          }
          dp[0][r][c] = max(dp[0][r][c], best)
          dp[1][r][c] = max(dp[1][r][c], best + items[r][c])
        }
        if (c - 1 >= 0) {
          for (s in 0 .. 3) {
            dp[s][r][c] = max(dp[s][r][c], dp[s][r][c - 1])
            if (s > 0) dp[s][r][c] = max(dp[s][r][c], dp[s-1][r][c - 1] + items[r][c])
          }
        }
      }
    }

    if (isDebug) {
      for (i in 0 until N) {
        debug{"DP($i)"}
        debugDim(dp[i])
      }
    }

    var ans = 0L
    for (s in 0 .. 3) {
      ans = max(ans, dp[s][N - 1][M - 1])
    }
    out.println(ans)
  }













































  private val isDebug = try {
    // なんか本番でエラーでる
    System.getenv("MY_DEBUG") != null
  } catch (t: Throwable) {
    false
  }

  private var tokenizer: StringTokenizer? = null
  private val reader = BufferedReader(InputStreamReader(stream), 32768)
  private fun next(): String {
    while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
      tokenizer = StringTokenizer(reader.readLine())
    }
    return tokenizer!!.nextToken()
  }

  private fun ni() = next().toInt()
  private fun nl() = next().toLong()
  private fun ns() = next()
  private fun na(n: Int, offset: Int = 0): IntArray {
    return map(n) { ni() + offset }
  }
  private fun nal(n: Int, offset: Int = 0): LongArray {
    val res = LongArray(n)
    for (i in 0 until n) {
      res[i] = nl() + offset
    }
    return res
  }

  private fun na2(n: Int, offset: Int = 0): Array<IntArray> {
    val a  = Array(2){IntArray(n)}
    for (i in 0 until n) {
      for (e in a) {
        e[i] = ni() + offset
      }
    }
    return a
  }

  private inline fun map(n: Int, f: (Int) -> Int): IntArray {
    val res = IntArray(n)
    for (i in 0 until n) {
      res[i] = f(i)
    }
    return res
  }

  private inline fun debug(msg: () -> String) {
    if (isDebug) System.err.println(msg())
  }

  private inline fun debug(a: LongArray) {
    debug { a.joinToString(" ") }
  }

  private inline fun debug(a: IntArray) {
    debug { a.joinToString(" ") }
  }

  private inline fun debug(a: BooleanArray) {
    debug { a.map { if (it) 1 else 0 }.joinToString("") }
  }

  private inline fun debugDim(A: Array<LongArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  private inline fun debugDim(A: Array<IntArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }

  /**
   * 勝手にimport消されるのを防ぎたい
   */
  private fun hoge() {
    min(1, 2)
    max(1, 2)
    abs(-10)
  }

  private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()}
}

fun main() {
  val out = java.io.PrintWriter(System.out)
  Solver(System.`in`, out).solve()
  out.flush()
}

Measured memory_bytes: 529692