#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, q;
    std::cin >> n >> q;
    
    std::vector a(2, std::vector<int>(n));
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < n; j++) {
            char c;
            std::cin >> c;
            a[i][j] = c - '0';
        }
    }
    
    std::vector<int> c(n);
    for (int i = n - 1, j = 0; i >= 0; i--) {
        c[i] = a[0][i] + a[1][i] + j;
        if (c[i] >= 10) {
            c[i] -= 10;
            j = 1;
        } else {
            j = 0;
        }
    }
    
    std::map<int, int> s;
    s[0] = -1;
    for (int i = 0; i < n; i++) {
        s[i + 1] = c[i];
    }
    
    while (q--) {
        int r, c, d;
        std::cin >> r >> c >> d;
        
        r--;
        c--;
        d -= a[r][c];
        a[r][c] += d;
        
        auto it = s.upper_bound(c);
        
        if (d == 0) {
            std::cout << it->second << " 0\n";
            continue;
        }
        
        if (it->first != c + 1) {
            it = s.emplace(c + 1, it->second).first;
        }
        
        if (std::prev(it)->first != c) {
            s.emplace(c, it->second);
        }
        
        int cnt = 2;
        it->second += d;
        int x = (it->second + 10) % 10;
        
        if (it->second < 0) {
            it->second += 10;
            while (std::prev(it)->first != 0 && std::prev(it)->second == 0) {
                s.erase(std::prev(it));
            }
            it--;
            cnt += c - it->first;
            if (it->first != c) {
                s.emplace(c, 9);
            }
            if (it->first != 0) {
                if (std::prev(it)->first != it->first - 1) {
                    s.emplace(it->first - 1, it->second);
                }
                it->second--;
                cnt++;
            }
        } else if (it->second >= 10) {
            it->second -= 10;
            while (std::prev(it)->first != 0 && std::prev(it)->second == 9) {
                s.erase(std::prev(it));
            }
            it--;
            cnt += c - it->first;
            if (it->first != c) {
                s.emplace(c, 0);
            }
            if (it->first != 0) {
                if (std::prev(it)->first != it->first - 1) {
                    s.emplace(it->first - 1, it->second);
                }
                it->second++;
                cnt++;
            }
        }
        
        std::cout << x << " " << cnt << "\n";
    }
    
    return 0;
}