#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 P = 998244353;
void solve() {
    int n, q;
    string s, t;
    cin >> n >> q >> s >> t;
    vector a(2, vector<int> (n + 1));
    for (int i = 0; i < n; i++) a[0][i + 1] = s[i] - '0';
    for (int i = 0; i < n; i++) a[1][i + 1] = t[i] - '0';
    set<int> st;
    for (int i = 0; i <= n; i++) {
        if (a[0][i] + a[1][i] != 9) st.insert(i);
    }
    while (q--) {
        int r, c, d, g = 0;
        cin >> r >> c >> d;
        r--;
        auto p1 = st.upper_bound(c);
        if (p1 != st.end() && a[0][*p1] + a[1][*p1] >= 10) {
            g = 1;
        } 
        cout << (a[r ^ 1][c] + d + g) % 10 << ' ';
        if (d == a[r][c]) {
            cout << 0 << '\n';
            return;
        }
        if ((a[r ^ 1][c] + a[r][c] + g) / 10 == (a[r ^ 1][c] + d + g) / 10) {
            cout << 2 << '\n';
        } else {
            int p2 = *prev(st.lower_bound(c));
            int ans = c - p2 + 1;
            if (p2 == 0) ans--;
            cout << ans + 1 << '\n';
        }
        if (a[r ^ 1][c] + a[r][c] != 9) st.erase(c);
        a[r][c] = d;
        if (a[r ^ 1][c] + a[r][c] != 9) st.insert(c);
    }
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--) solve();
    return 0;
}