#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
//#define mod 998244353ll
#define flagcount __builtin_popcount
#define flag(x) (1ll << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1ll << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) (distance(v.begin(), low2way(v, x)))  //配列vでx未満の要素数を返す
#define idx_upper(v, x) (distance(v.begin(), high2way(v, x))) //配列vでx以下の要素数を返す
#define idx_lower2(v, x) (v.size() - idx_lower(v, x))         //配列vでx以上の要素数を返す
#define idx_upper2(v, x) (v.size() - idx_upper(v, x))         //配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c)
{
    if (c >= '0' && c <= '9')
    {
        return c - '0';
    }
    return -1;
}
template <typename T>
T lcm(T x, T y)
{
    T z = gcd(x, y);
    return x * y / z;
}
template <typename T>
bool primejudge(T n)
{
    if (n < 2)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;
    double sqrtn = sqrt(n);
    for (T i = 3; i < sqrtn + 1; i++)
    {
        if (n % i == 0)
        {
            return false;
        }
        i++;
    }
    return true;
}
template <typename T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b; // aをbで更新
        return true;
    }
    return false;
}
template <typename T>
bool chmin(T &a, const T &b)
{
    if (a > b)
    {
        a = b; // aをbで更新
        return true;
    }
    return false;
}
//場合によって使い分ける
//const ll dx[4]={1,0,-1,0};
//const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
//2次元配列の宣言
//vector<vector<ll>> field(h, vector<ll>(w));
ll dp[3010][3010][4]; //dp[x][y][z]:今座標(x,y)にいて、x行目でz個のアイテムを拾っているときの価値の最大値
int main()
{
    cout << fixed << setprecision(30);
    ll R, C, K;
    cin >> R >> C >> K;
    vector<vector<ll>> field(R, vector<ll>(C));
    loop(i, R) loop(j, C) field[i][j] = 0;
    loop(i, K)
    {
        ll r, c, v;
        cin >> r >> c >> v;
        r--;
        c--;
        field[r][c] = v;
    }
    dp[0][0][1] = field[0][0];
    loop(i, R)
    {
        loop(j, C)
        {
            ll x = i, y = j;
            //右に移動する場合
            ll nx = i, ny = j + 1;
            if (ny < C)
            {
                chmax(dp[nx][ny][0], dp[x][y][0]);
                chmax(dp[nx][ny][1], dp[x][y][1]);
                chmax(dp[nx][ny][2], dp[x][y][2]);
                chmax(dp[nx][ny][3], dp[x][y][3]);
                chmax(dp[nx][ny][1], dp[x][y][0] + field[nx][ny]);
                chmax(dp[nx][ny][2], dp[x][y][1] + field[nx][ny]);
                chmax(dp[nx][ny][3], dp[x][y][2] + field[nx][ny]);
            }
            //下に移動する場合
            ll nnx = i + 1, nny = j;
            if (nnx < R)
            {
                chmax(dp[nnx][nny][0], dp[x][y][0]);
                chmax(dp[nnx][nny][0], dp[x][y][1]);
                chmax(dp[nnx][nny][0], dp[x][y][2]);
                chmax(dp[nnx][nny][0], dp[x][y][3]);
                chmax(dp[nnx][nny][1], dp[x][y][0] + field[nnx][nny]);
                chmax(dp[nnx][nny][1], dp[x][y][1] + field[nnx][nny]);
                chmax(dp[nnx][nny][1], dp[x][y][2] + field[nnx][nny]);
                chmax(dp[nnx][nny][1], dp[x][y][3] + field[nnx][nny]);
            }
        }
    }
    ll ans = 0;
    loop(i, 4) chmax(ans, dp[R - 1][C - 1][i]);
    putout(ans);
    return 0;
}


Measured memory_bytes: 355940