#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = 1'000'000'000LL + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
int msb(int x) {return x?31-__builtin_clz(x):-1;}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    cin.tie(0);ios::sync_with_stdio(false);
    int H,W,K; cin >> H >> W >> K;
    auto grid = multivector(H,W,0LL);
    for(int i = 0; i < K; ++i) {
        int y,x,v;
        cin >> y >> x >> v;
        y--,x--;
        grid[y][x]=v;
    }
    auto dp = multivector(H,W,4,0LL);
    dp[0][0][1]+=grid[0][0];
    for(int i = 0; i < H; ++i) {
        for(int j = 0; j < W; ++j) {

            if(i) {
                //使わないとき
                for(int k=0;k<=3;++k){
                    chmax(dp[i][j][0],dp[i-1][j][k]);
                }
                //使うとき
                for(int k=0;k<=3;++k){
                    chmax(dp[i][j][1],dp[i-1][j][k]+grid[i][j]);
                }
            }

            if(j) {
                //使わないとき
                for(int k=0;k<=3;++k){
                    chmax(dp[i][j][k],dp[i][j-1][k]);
                }
                //使うとき
                for(int k=0;k<=3;++k){
                    if(k+1<=3)chmax(dp[i][j][k+1],dp[i][j-1][k]+grid[i][j]);
                }
            }
        }
    }
    ll ans = 0;
    for(int k=0;k<=3; ++k) {
        chmax(ans,dp[H-1][W-1][k]);
    }
    cout << ans << endl; 
    return 0;
}


Measured memory_bytes: 706688