#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
int n,q;
int a[3][1000005];
struct node{int l,r,mn,mx,tg;}t[1000005<<2];
#define l(p) t[p].l
#define r(p) t[p].r
#define mn(p) t[p].mn
#define mx(p) t[p].mx
#define tg(p) t[p].tg
void build(int p,int l,int r){
	l(p)=l,r(p)=r;
	if(l==r)return mn(p)=mx(p)=a[2][l],void();
	int mid=l+r>>1;
	build(p<<1,l,mid),build(p<<1|1,mid+1,r);
	mn(p)=min(mn(p<<1),mn(p<<1|1)),mx(p)=max(mx(p<<1),mx(p<<1|1));
}
inline void ch(int p,int k){mn(p)+=k,mx(p)+=k,tg(p)+=k;}
inline void spread(int p){if(tg(p))ch(p<<1,tg(p)),ch(p<<1|1,tg(p)),tg(p)=0;}
void add(int p,int l,int r,int k){
	// if(p==1)cout<<"???   "<<l<<' '<<r<<' '<<k<<endl;
	if(l<=l(p)&&r(p)<=r)return ch(p,k),assert(mn(p)>=0&&mx(p)<=9);
	spread(p);int mid=l(p)+r(p)>>1;
	if(l<=mid)add(p<<1,l,r,k);
	if(r>mid)add(p<<1|1,l,r,k);
	mn(p)=min(mn(p<<1),mn(p<<1|1)),mx(p)=max(mx(p<<1),mx(p<<1|1));
}
int ask(int p,int x){
	if(l(p)==r(p))return mn(p);
	return spread(p),ask(p<<1|(x>(l(p)+r(p)>>1)),x);
}
int find(int p,int r,int k){
	if(l(p)==r(p))return (mn(p)==k&&mx(p)==k)?l(p):-1;
	if(r(p)<=r&&mn(p)==k&&mx(p)==k)return l(p);
	spread(p);int mid=l(p)+r(p)>>1;
	if(r<=mid)return find(p<<1,r,k);
	else{
		int x=find(p<<1|1,r,k);
		if(x!=mid+1)return x;
		else{
			x=find(p<<1,r,k);
			return x==-1?mid+1:x;
		}
	}
}
void dfs(int p){
	if(l(p)==r(p))return cout<<mn(p),void();
	spread(p),dfs(p<<1),dfs(p<<1|1);
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>q;
	for(int i=1;i<=n;i++){
		char c;cin>>c,a[0][i]=c-'0';
	}
	for(int i=1;i<=n;i++){
		char c;cin>>c,a[1][i]=c-'0';
	}
	for(int i=n;i>=1;i--){
		a[2][i]=a[0][i]+a[1][i]+a[2][i+1]/10,a[2][i+1]%=10;
	}a[2][1]%=10;
	build(1,1,n);
	// dfs(1),cout<<endl;
	while(q--){
		int r,c,d;cin>>r>>c>>d,r--;
		int X=ask(1,c);
		cout<<(X+d-a[r][c]+100)%10<<' ';
		if(a[r][c]==d){cout<<'0'<<endl;continue;}
		if(a[r][c]+a[r^1][c]<=X){
			if(d-a[r][c]+X<10)add(1,c,c,d-a[r][c]),cout<<'2'<<endl;
			else{
				add(1,c,c,d-a[r][c]-10);
				if(c==1)cout<<'2'<<endl;
				else{
					int k=find(1,c-1,9);
					if(k==-1)add(1,c-1,c-1,1),cout<<'3'<<endl;
					else{
						add(1,k,c-1,-9);
						if(k>1)add(1,k-1,k-1,1),cout<<c-k+3<<endl;
						else cout<<c-k+2<<endl;
					}
				}
			}
		}else{
			if(d-a[r][c]+X>=0)add(1,c,c,d-a[r][c]),cout<<'2'<<endl;
			else{
				add(1,c,c,d-a[r][c]+10);
				if(c==1)cout<<'2'<<endl;
				else{
					int k=find(1,c-1,0);
					if(k==-1)add(1,c-1,c-1,-1),cout<<'3'<<endl;
					else{
						add(1,k,c-1,9);
						if(k>1)add(1,k-1,k-1,-1),cout<<c-k+3<<endl;
						else cout<<c-k+2<<endl;
					}
				}
			}
		}
		a[r][c]=d;
		// dfs(1),cout<<endl;
	}
	return 0;
}