#include <bits/stdc++.h>
#define ott(i,l,r) for (int i = l; i <= r; i ++)
#define tto(i,l,r) for (int i = r; i >= l; i --)
using namespace std;
using ll = long long;
int read () {
	int x = 0; bool f = 0; char c = getchar ();
	while (!isdigit (c)) f |= (c == '-'), c = getchar ();
	while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
	if (f) x = -x; return x;
}
const int N = 1e6 + 110;	
int n, q, ng;
int a[N], b[N];
char s[N];
int tr[N];
int lo (int x) {
	return x & (-x);
}
void add (int x, int v) {
	while (x <= n) {
		tr[x] += v;
		x += lo (x);
	}
	return ;
}
int ask (int x) {
	int v = 0;
	while (x) {
		v += tr[x];
		x -= lo (x);
	}
	return v;
}
int main () {
	scanf ("%d %d", &n, &q);
	scanf ("%s", s + 1); ott (i, 1, n) a[i] = s[i] - '0';
	scanf ("%s", s + 1); ott (i, 1, n) b[i] = s[i] - '0';
	ott (i, 1, n) if (a[i] + b[i] == 9) add (i, 1);
	while (q --) {
		int x, y, z, l, r, mid, val, sum = 0; bool fl = 0, fr = 0; scanf ("%d %d %d", &x, &y, &val);
		if (a[y] + b[y] > 10) fl ^= 1;
		else if (a[y] + b[y] == 9) {
			z = l = y + 1, r = n + 1; 
			while (l <= r) {
				mid = l + r >> 1;
				if (ask (mid - 1) - ask (y) == mid - 1 - y) z = mid, l = mid + 1;
				else r = mid - 1;
			}
			fl ^= (a[z] + b[z] > 10);
			add (y, -1);
		}
		if (x == 1) fr = (a[y] == val), a[y] = val; else fr = (b[y] == val), b[y] = val;
		z = y + 1;
		if (a[y] + b[y] > 10) fl ^= 1;
		if (a[y] + b[y] == 9) add (y, 1);
		l = y + 1, r = n + 1; 
		while (l <= r) {
			mid = l + r >> 1;
			if (ask (mid - 1) - ask (y) == mid - 1 - y) z = mid, l = mid + 1;
			else r = mid - 1;
		}
		if (a[y] + b[y] == 9) fl ^= (a[z] + b[z] > 10);
		printf ("%d ", (a[y] + b[y] + (a[z] + b[z] > 10)) % 10);
		z = y;
		if (fl) {
			l = 1, r = y;
			while (l <= r) {
				mid = l + r >> 1;
				if (ask (y - 1) - ask (mid) == y - 1 - mid) z = mid, r = mid - 1;
				else l = mid + 1;
			}
		}
		if (fr) z += 2;
		printf ("%d\n", y - z + 2);
		//ott (j, 1, n) printf ("%d ", a[j] + b[j]); puts ("");
	}
	return 0;
}