#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const int N=1e6+10;
int n,m,a[2][N],b[N];
char s[2][N];
int t[N<<2],laz[N<<2];
void pushup(int rt){
	t[rt]=t[rt<<1]|t[rt<<1|1];
}
void pushcov(int rt,int x){
	t[rt]=1<<x,laz[rt]=x;
}
void pushdown(int rt){
	if(~laz[rt]){
		pushcov(rt<<1,laz[rt]);
		pushcov(rt<<1|1,laz[rt]);
		laz[rt]=-1;
	}
}
void build(int l=1,int r=n,int rt=1){
	laz[rt]=-1;
	if(l==r){
		t[rt]=1<<b[l];return;
	}
	int mid=(l+r)>>1;
	build(l,mid,rt<<1);
	build(mid+1,r,rt<<1|1);
	pushup(rt);
}
void cover(int L,int R,int x,int l=1,int r=n,int rt=1){
	if(L<=l&&r<=R)return pushcov(rt,x);
	int mid=(l+r)>>1;
	pushdown(rt);
	if(L<=mid)cover(L,R,x,l,mid,rt<<1);
	if(mid<R)cover(L,R,x,mid+1,r,rt<<1|1);
	pushup(rt);
}
void update(int x,int y,int l=1,int r=n,int rt=1){
	if(l==r){
		if(y>0)t[rt]<<=y;
		else t[rt]>>=-y;
		return;
	}
	int mid=(l+r)>>1;
	pushdown(rt);
	if(x<=mid)update(x,y,l,mid,rt<<1);
	else update(x,y,mid+1,r,rt<<1|1);
	pushup(rt);
}
int query(int x,int l=1,int r=n,int rt=1){
	if(l==r)return __lg(t[rt]);
	int mid=(l+r)>>1;
	pushdown(rt);
	if(x<=mid)return query(x,l,mid,rt<<1);
	else return query(x,mid+1,r,rt<<1|1);
}
int findlast(int L,int R,int S,int l=1,int r=n,int rt=1){
	if(!(t[rt]&S))return 0;
	if(l==r)return l;
	int mid=(l+r)>>1,s=0;
	pushdown(rt);
	if(mid<R)s=findlast(L,R,S,mid+1,r,rt<<1|1);
	if(s)return s;
	return findlast(L,R,S,l,mid,rt<<1);
}
void add(int x,int y){
	int d=query(x);
	cover(x,x,(d+y)%10);
	if(d+y<=9){
		printf("%d %d\n",d+y,2);
		return;
	}
	int id=x>1?findlast(1,x-1,0x1ff):0,cnt=2;
	if(id+1<x)cover(id+1,x-1,0),cnt+=x-id-1;
	if(id)update(id,1),cnt++;
	printf("%d %d\n",(d+y)%10,cnt);
}
void sub(int x,int y){
	int d=query(x);
	cover(x,x,(d-y+10)%10);
	if(d>=y){
		printf("%d %d\n",d-y,2);
		return;
	}
	int id=x>1?findlast(1,x-1,0x3fe):0,cnt=2;
	if(id+1<x)cover(id+1,x-1,9),cnt+=x-id-1;
	if(id)update(id,-1),cnt++;
	printf("%d %d\n",(d-y+10)%10,cnt);
}
// void print(){
// 	vector<int>a;
// 	for(int i=1;i<=n;i++)a.push_back(query(i));
// 	debug(a);
// }
int main(){
	scanf("%d%d%s%s",&n,&m,s[0]+1,s[1]+1);
	for(int i=n;i>=1;i--){
		for(int j=0;j<2;j++)a[j][i]=s[j][i]-'0';
		b[i]+=a[0][i]+a[1][i];
		if(i>1)b[i-1]+=b[i]/10;
		b[i]%=10;
	}
	// debug(bitset<10>(0x1ff));
	// debug(bitset<10>(0x3fe));
	// debug(ary(b,1,n));
	build();
	for(int r,c,x;m--;){
		scanf("%d%d%d",&r,&c,&x);
		int las=a[--r][c];
		if(las==x){
			printf("%d 0\n",query(c));continue;
		}
		a[r][c]=x;
		if(las<x)add(c,x-las);
		else sub(c,las-x);
		// print();
	}
	return 0;
}