#include <bits/stdc++.h>

using loint = long long;
using db = double;

void solve() {
    
    int n, m;
    std::cin >> n >> m;
    int inv = 0;
    if (n > m) {
        std::swap(n, m);
        inv = 1;
    }
    std::vector<std::pair<int, int>> ans;
    if (n == m) {
        for (int i = 1; i <= n; i ++) {
            ans.push_back({i, 1});
        }
        for (int i = 2; i <= n - 1; i ++) {
            ans.push_back({i, m});
        }
    } else if (n & 1) {
        for (int i = 1; i <= n; i ++) {
            ans.push_back({i, 1});
        }
        for (int i = 1; i <= n; i ++) {
            ans.push_back({i, m});
        }
        int l = n / 2 + 2, r = m - (n / 2 + 1);
        for (int j = l; j <= r; j ++) {
            ans.push_back({n / 2 + 1, j});
        }
    } else {

        for (int i = 1; i <= n; i ++) {
            ans.push_back({i, 1});
        }
        for (int i = 1; i <= n; i ++) {
            ans.push_back({i, m});
        }
        int l = n / 2 + 2, r = m - (n / 2 + 1);
        for (int j = l; j <= n / 2; j += 2) {
            ans.push_back({n / 2, j});
            ans.push_back({n / 2 + 1, j});
        }
        for (int j = r; j >= n / 2 + 1; j -= 2) {
            ans.push_back({n / 2, j});
            ans.push_back({n / 2 + 1, j});
        }

    }

    std::cout << ans.size() << '\n';
    std::vector a(n + 5, std::vector<int> (m + 5, 0));
    for (auto &[x, y] : ans) {
        if (inv) std::swap(x, y);
        std::cout << x << ' ' << y << '\n';
    }
}

int main() {

    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    std::cout.tie(0);

    solve();

    return 0;
}