#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define dep(i, l, r) for (int i = r; i >= l; --i)
const int N = 1e6 + 5;
int n, q, r, c, d, ans, a[N], b[N], s[3][N]; char s1[N], s2[N]; 

struct ST {
  #define ls (p << 1)
  #define rs (p << 1 | 1)
  #define mid ((l + r) >> 1)
  struct node { int mi, tgc; } t[N << 2];
  struct tree { int p, l, r; } st[N];
  int tp; 

  void build (int p, int l, int r) {
    t[p].tgc = -1; 
    if(l == r) return ;
    build(ls, l, mid), build(rs, mid + 1, r); 
  }
  void lazy (int p, int k) {
    t[p].mi = t[p].tgc = k; 
  } 
  void down (int p) {
    if(t[p].tgc == -1) return ; 
    lazy(ls, t[p].tgc), lazy(rs, t[p].tgc), t[p].tgc = -1; 
  }
  void update (int p, int l, int r, int x, int y, int k) {
    if(l >= x && r <= y) return lazy(p, k), void();
    down(p); 
    if(mid >= x) update(ls, l, mid, x, y, k); 
    if(mid < y) update(rs, mid + 1, r, x, y, k); 
    t[p].mi = min(t[ls].mi, t[rs].mi); 
  }
  void qry (int p, int l, int r, int k) {
    if(r <= k) return st[++tp] = (tree){p, l, r}, void(); 
    if(l == r) return ; 
    if(mid <= k) st[++tp] = (tree){ls, l, mid}, qry(rs, mid + 1, r, k); 
    else qry(ls, l, mid, k); 
  }
  int query (int p, int l, int r) {
    // printf("now here is %d %d %d\n", p, l, r); 
    if(l == r) return l; 
    down(p); 
    if(!t[rs].mi) return query(rs, mid + 1, r);
    else return query(ls, l, mid); 
  }
  int query (int p, int l, int r, int x, int y) {
    if(l >= x && r <= y) return t[p].mi;
    down(p); 
    if(mid >= x) return query(ls, l, mid, x, y); 
    else return query(rs, mid + 1, r, x, y); 
  }
} T[2]; 

int main () {
  scanf("%d%d%s%s", &n, &q, s1 + 1, s2 + 1); 
  rep(i, 1, n) {
    s[1][i] = s1[i] - '0', s[2][i] = s2[i] - '0'; 
    a[i] = s1[i] - '0' + s2[i] - '0'; 
  }
  T[0].build(1, 1, n), T[1].build(1, 1, n); 
  rep(i, 1, n) if(a[i] == 9) T[0].update(1, 1, n, i, i, 1); 
  dep(i, 1, n) {
    b[i] = a[i] + (b[i + 1] >= 10); 
    if(b[i] >= 10) T[1].update(1, 1, n, i, i, 1); 
  }
  // rep(i, 1, n) cout << T[0].query(1, 1, n, i, i) << ' '; cout << '\n'; 
  while (q--) {
    scanf("%d%d%d", &r, &c, &d), ans = 0; 
    int o = T[1].query(1, 1, n, c, c); 
    int ro = (c == n ? 0 : T[1].query(1, 1, n, c + 1, c + 1));
    ans += 2 * (s[r][c] != d); 
    s[r][c] = d, a[c] = s[1][c] + s[2][c]; 
    int no = (a[c] + ro >= 10); 
    // cout << "o = " << o << ' ' << "no = " << no << '\n'; 
    if(no != o) {
      int l = 0;
      T[0].tp = 0, T[0].qry(1, 1, n, c - 1);
      dep(i, 1, T[0].tp) if(!T[0].t[T[0].st[i].p].mi) {
        l = T[0].query(T[0].st[i].p, T[0].st[i].l, T[0].st[i].r);
        break ; 
      }
      ans += c - l; if(!l) --ans;  
      // cout << "l = " << l << ' ' << r << ' ' << c << '\n'; 
      if(l + 1 < c) T[1].update(1, 1, n, l + 1, c - 1, no); 
    }
    printf("%d %d\n", (a[c] + ro) % 10, ans); 
    T[0].update(1, 1, n, c, c, (a[c] == 9)); 
    T[1].update(1, 1, n, c, c, no); 
  }
  return 0; 
}