#include <bits/stdc++.h> 
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
 #define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)

ll mod=998244353;


struct segtree {
ll n;
vector<ll> dat;
void init(ll n_) {
    n=1;
    while (n<n_) n*=2;
dat=vector<ll> (2*n-1,0LL);
}

    void update(ll k, ll a) {
        k+=n-1;
        dat[k]+=a;
  dat[k]%=mod;



        while(k>0) {
            k=(k-1)/2;
            dat[k]=dat[k*2+1]+dat[2*k+2];
        }
    }

    ll query (ll a, ll b, ll k,ll l, ll r) {

        if(r<=a||b<=l) return 0;

        if(a<=l&&r<=b) return dat[k];

        else {
            ll vl=query(a,b,k*2+1,l,(l+r)/2);
            ll vr=query(a,b,k*2+2,(l+r)/2,r);
            return vl+vr;
        }
    }

};


int main() {
  ll H,W,K;cin>>H>>W>>K;


vector<vector<ll>> memo(H,vector<ll> (W,0));


for(ll i=0;i<K;i++) {
  ll x,y,v;cin>>x>>y>>v;
  x--;y--;
  memo[x][y]+=v;

}




segtree p;
p.init(H+W+10);

ll ans=0;

 for(ll i=H-1;i>=1-W;i--) {


  for(ll t=max(0LL,i);t<H;t++) {
    p.update(t+(t-i),memo[t][t-i]);
  }
 
  for(ll t=max(0LL,i);t<H;t++) {
    ans+=p.query(t+t-i,H+W,0,0,p.n);
    ans%=mod;
  }
 }

 

cout<<ans<<endl;
}