#include<bits/stdc++.h>
const int N = 103, B = 30, lim = (1<<B)-1, L = 1e9, K = 30;
typedef long long LL;
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
int n, m, q;
std::string s[2][N];
void clr(std::vector<LL> &a){while(!a.empty() && !a.back()) a.pop_back();}
struct bigD : public std::vector<LL> {using vector<LL>::vector;} T[K][N][N], A[K][N][N], half, dt[K];
bigD operator + (const bigD &a, const bigD &b){
	bigD res(std::max(a.size(), b.size()));
	for(int i = (int)res.size()-1;i >= 0;-- i){
		res[i] += (i < a.size() ? a[i] : 0) + (i < b.size() ? b[i] : 0);
		if(res[i] > lim){res[i] &= lim; if(i) ++res[i-1];}
	}
	clr(res); return res;
}
bigD operator - (bigD a){
	if(a.empty()) return a;
	a.back() = (-a.back()) & lim;
	for(int i = 0;i+1 < a.size();++ i) a[i] ^= lim;
	return a;
}
bigD operator - (const bigD &a, const bigD &b){return a + (-b);}
bigD operator * (const bigD &a, const bigD &b){
	if(a.empty() || b.empty()) return {};
	bigD res(a.size() + b.size());
	for(int i = 0;i < a.size();++ i)
		for(int j = 0;j < b.size();++ j)
			res[i+j+1] += a[i] * b[j];
	for(int i = (int)res.size()-1;i >= 0;-- i){
		if(i) res[i-1] += (res[i] >> B);
		res[i] &= lim;
	}
	clr(res); return res;
}
int len(const bigD &a){return a.empty() ? 0 : B * a.size() - __builtin_ctzll(a.back());}
bigD operator << (const bigD &a, int sh){
	int bl = sh / B, rem = sh % B;
	bigD res(a.size());
	if(bl < a.size()) res[0] = a[bl] << rem & lim;
	for(int i = bl+1;i < a.size();++ i){
		res[i-bl] |= a[i] << rem & lim;
		res[i-bl-1] |= a[i] >> B - rem;
	}
	clr(res); return res;
}
bigD operator >> (const bigD &a, int sh){
	int bl = sh / B, rem = sh % B;
	bigD res(a.size() + bl + 1);
	for(int i = 0;i < a.size();++ i){
		res[i+bl] |= a[i] >> rem;
		res[i+bl+1] |= (a[i] << B - rem) & lim;
	}
	clr(res); return res;
}
bigD inv(bigD a){
	bigD res = a; int bt = len(a);
	for(int i = 0;i < bt-2;++ i){
		a = a * a << bt;
		res = res * a << bt;
	}
	clr(res); return res;
}
struct bigI : public std::vector<LL> {using vector<LL>::vector;};
bigI operator + (const bigI &a, LL coe){
	bigI res(a.size() + 1); res[0] = coe;
	for(int i = 0;i < res.size();++ i){
		if(i < a.size()) res[i] += a[i];
		res[i+1] += res[i] / L; res[i] %= L;
	}
	clr(res); return res;
}
bigI operator * (const bigI &a, LL coe){
	bigI res(a.size() + 3);
	for(int i = 0;i < res.size();++ i){
		if(i < a.size()) res[i] += a[i] * coe;
		res[i+1] += res[i] / L; res[i] %= L;
	}
	clr(res); return res;
}
bigI getnum(const bigD &a, int L = -1){
	if(L == -1) L = len(a);
	bigI res; int rem = L % B;
	for(int i = 0;i < L / B;++ i) res = res * (1 << B) + (i < a.size() ? a[i] : 0);
	res = res * (1 << rem) + (L / B < a.size() ? (a[L / B] >> B - rem) : 0);
	clr(res); return res;
}
std::ostream &operator << (std::ostream &out, const bigI &a){
	if(a.empty()) return out << 0;
	out << a.back();
	for(int i = (int)a.size() - 2;~i;-- i) out << std::setfill('0') << std::setw(9) << a[i];
	return out;
}
void work(int id){
	auto t = T[id], a = A[id];
	for(int i = n-1;i >= 0;-- i)
		for(int j = m-1;j >= 0;-- j) if(s[0][i][j] != '.'){
			bigD right = t[i][j+1] >> 1, down = t[i+1][j] >> 1;
			t[i][j] = right + down;
			a[i][j] = right - down;
			if(rng() & 1){
				t[i][j] = t[i][j] + half;
				a[i][j] = a[i][j] + half;
			}
		}
}
int main(){
	std::ios::sync_with_stdio(false);
	half.push_back(1 << B - 1);
	std::cin >> n >> m >> q;
	for(int i = 0;i < 2;++ i)
		for(int j = 0;j < n;++ j)
			std::cin >> s[i][j];
	int L = 0;
	for(int id = 0;id < K;++ id){
		work(id);
		L = std::max(L, len(T[id][0][0]));
	}
	for(int id = 0;id < K;++ id){
		while(len(T[id][0][0]) < L) work(id);
		bigD tmp = inv(T[id][0][0]);
		for(int i = 0;i < n;++ i)
			for(int j = 0;j < m;++ j){
				A[id][i][j] = A[id][i][j] * tmp << L;
				if(s[0][i][j] == '>') dt[id] = dt[id] + A[id][i][j];
				if(s[1][i][j] == '>') dt[id] = dt[id] - A[id][i][j];
			}
	}
	auto solve = [&](){
		bool flg = true;
		for(int i = 1;i < K && flg;++ i) flg &= dt[i] == dt[0];
		if(flg) std::cout << getnum(min(dt[0], -dt[0]), L) << '\n';
		else std::cout << "-1\n";
	};
	solve();
	while(q --){
		int op, r, c;
		std::cin >> op >> r >> c;
		-- op; -- r; -- c;
		bool flg = op ^ (s[op][r][c] == 'v');
		s[op][r][c] ^= '>' ^ 'v';
		for(int id = 0;id < K;++ id)
			dt[id] = flg ? dt[id] + A[id][r][c] : dt[id] - A[id][r][c];
		solve();
	}
}