#include <iostream>
using namespace std;

const int MAX_M = 50;

int main() {
    int n, m;
    cin >> n >> m;                    // 子題組 1 保證 n = 1：陣列只有一列
    int a[MAX_M];
    for (int j = 0; j < m; j++) cin >> a[j];

    int count = 0;
    bool special[MAX_M];              // 先記下每個位置是不是特殊位置，數完個數再印
    for (int j = 0; j < m; j++) {
        int x = a[j];
        int total = 0;
        for (int c = j - x; c <= j + x; c++) {    // 距離不超過 x：第 j - x 到第 j + x 個
            if (c < 0 || c >= m) continue;        // 超出陣列的不計算
            total += a[c];
        }
        special[j] = (total % 10 == x % 10);
        if (special[j]) count++;
    }

    cout << count << '\n';
    for (int j = 0; j < m; j++) {
        if (special[j]) cout << 0 << ' ' << j << '\n';
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

int n, m;
vector<vector<int>> a;

bool inside(int r, int c) {
    return 0 <= r && r < n && 0 <= c && c < m;
}

int main() {
    cin >> n >> m;
    a.assign(n, vector<int>(m));
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            cin >> a[i][j];

    vector<pair<int, int>> answer;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            int x = a[i][j];
            int total = 0;
            for (int di = -x; di <= x; di++) {          // 枚舉「範圍」裡的每一格
                for (int dj = -x; dj <= x; dj++) {
                    if (abs(di) + abs(dj) > x) continue;   // 曼哈頓距離超過 x：不在範圍內
                    int r = i + di, c = j + dj;
                    if (!inside(r, c)) continue;           // 出界的格子不計算
                    total += a[r][c];
                }
            }
            if (total % 10 == x % 10) answer.push_back({i, j});
        }
    }
    cout << answer.size() << '\n';
    for (auto [r, c] : answer) cout << r << ' ' << c << '\n';
    return 0;
}