#include <bits/stdc++.h>
using namespace std;
int powmod(int b, int e, int m) {
b %= m;
int res = 1;
while (0 < e) {
if (e & 1)
res = (res * b) % m;
b = (b * b) % m;
e >>= 1;
}
return res;
}
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<tuple<int, int, int>> given;
for (int i = 0; i < k; i++) {
char pm;
int y, x;
cin >> pm >> y >> x;
y--;
x--;
if (pm == '+')
given.push_back({y, x, 1});
else if (pm == '-')
given.push_back({y, x, 0});
else
cerr << "BAD!" << "\n";
}
int freehor = n, freever;
bool possiblehor = true, possiblever = false;
vector<int> statushor(n, -1), statusver(m, -1);
for (int i = 0; i < k; i++) {
auto [y, x, flip] = given[i];
int fliphor = (flip + x) % 2;
if (statushor[y] == -1) {
freehor--;
statushor[y] = fliphor;
} else if (statushor[y] != fliphor)
possiblehor = false;
int flipver = (flip + y) % 2;
if (statusver[x] == -1) {
freever--;
statusver[x] = flipver;
} else if (statusver[x] != flipver)
possiblever = false;
}
int ans = 0;
if (possiblehor)
ans += powmod(2, freehor, 1e9 + 7);
if (possiblever)
ans += powmod(2, freever, 1e9 + 7);
if (possiblever && possiblehor) {
int t1 = 1, t2 = 1;
for (int i = 0; i < n; i++) {
if (statushor[i] != -1 && statushor[i] == i % 2)
t1 = 0;
if (statushor[i] != -1 && statushor[i] == (i + 1) % 2)
t2 = 0;
}
ans -= t1 + t2;
}
cout << ans << endl;
return 0;
}
