#include<bits/stdc++.h>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...) 69
#endif
using namespace std;
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//https://quera.org/profile/4dykhk
typedef long long ll;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int N = 1e5 + 23;
const int sq = 450;
const ll mod = 1e9+7; // 998244353
const int LOG = 23;
const ll inf = 1e18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define F first
#define S second
#define pb push_back
#define ms(x,y) memset((x) , (y) , sizeof (x))
#define done return cout<<endl , 0;
#define kill(x) cout<<x<<endl, exit(0);
#define isIn(x,s,e) ((x) >= (s) && (x) <= e)
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define pc(x) __builtin_popcount(x)
#define ctz(x) __builtin_ctz(x)
#define MinHeap(x) priority_queue<x, vector<x> , greater<x> >
#define MaxHeap(x) priority_queue<x, vector<x>>
#define lc (v << 1)
#define rc ((v<<1) |1)
#define int ll
ll pw(ll a, ll b, ll md = mod){ll res = 1; while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}
int n,m,k;
pair<int,pii> a[N];
map<int,int> mp;
bool tc= true;
int32_t main() {
cin.tie(nullptr)->sync_with_stdio(false);
cin>>n>>m>>k;
if(k == 0 ){
cout<<( (pw(2,n) + pw(2,m))%mod -2 + mod) %mod;
done;
}
for(int i = 0 ;i < k ; i++) {
//debug(i);
char c; cin>>c;
a[i].F = (c == '+');
cin>>a[i].S.F >> a[i].S.S;
}
int s1=0;
for(int i = 0;i < k; i++) {
//debug(i);
auto [x,y] = a[i].S;
int v = a[i].F;
if(mp[x] == 0) {
s1++;
mp[x] = (v ^ (y&1)) + 1;
} else if((mp[x]-1) != (v ^(y&1)) ) {
s1 = -1;
break;
}
}
int ans1=0;
debug(n,s1);
if(s1 == -1) {
tc = false;
} else {
ans1 = pw(2,n-s1);
}
mp.clear();
int s2=0;
for(int i = 0;i < k; i++) {
//debug(i);
auto [x,y] = a[i].S;
int v = a[i].F;
if(mp[y] == 0) {
s2++;
mp[y] = (v ^ (x&1)) + 1;
} else if((mp[y]-1) != (v ^(x&1)) ) {
s2 = -1;
break;
}
}
int ans2=0;
debug(m,s2);
if(s2 == -1) {
tc = false;
} else {
ans2 = pw(2,m-s2);
}
debug(ans1,ans2);
cout<<((ans1 + ans2) % mod-tc+mod) % mod;
done;
}
