#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define mp make_pair
#define pb push_back

map<pii,int> M;
vi a[500000],b[500000];
vi adj[500000];
int visited[500000];
int keep[500000];
int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(0);
    int n,m;
    cin >> n >> m;

    int i;
    if (n == 1) {
        cout << m << endl;
        for (i = 0; i < m; i++) cout << 1 << " " << i+1 << endl;
        return 0;
    }
    else if (m == 1) {
        cout << n << endl;
        for (i = 0; i < n; i++) cout << i+1 << " " << 1 << endl;
        return 0;
    }

    int c = 0;
    for (i = 0; i < m; i++) M[mp(0,i)] = c++;
    for (i = 1; i < n-1; i++) M[mp(i,0)] = c++;
    for (i = 0; i < m; i++) M[mp(n-1,i)] = c++;
    for (i = 1; i < n-1; i++) M[mp(i,m-1)] = c++;
    for (auto [p,x]: M) {
        a[p.first+p.second].pb(x);
        b[p.first-p.second+m].pb(x);
    }
    for (i = 0; i < 500000; i++) {
        if (a[i].size() >= 2) {
            adj[a[i][0]].pb(a[i][1]);
            adj[a[i][1]].pb(a[i][0]);
        }
        if (b[i].size() >= 2) {
            adj[b[i][0]].pb(b[i][1]);
            adj[b[i][1]].pb(b[i][0]);
        }
    }
    int j,ans = 0;
    for (i = 0; i < c; i++) {
        if (!visited[i] && (adj[i].size() <= 1)) {
            int u = i;
            vi o;
            do {
                int f = 0;
                visited[u] = 1;
                o.pb(u);
                for (int v: adj[u]) {
                    if (!visited[v]) {
                        u = v;
                        f = 1;
                        break;
                    }
                }
                if (!f) break;
            } while (u != i);
            for (j = 0; j < o.size(); j += 2) keep[o[j]] = 1,ans++;
        }
    }
    for (i = 0; i < c; i++) {
        if (!visited[i]) {
            int u = i;
            vi o;
            do {
                int f = 0;
                visited[u] = 1;
                o.pb(u);
                for (int v: adj[u]) {
                    if (!visited[v]) {
                        u = v;
                        f = 1;
                        break;
                    }
                }
                if (!f) break;
            } while (u != i);
            for (j = 0; j < o.size(); j += 2) keep[o[j]] = 1,ans++;
        }
    }
    cout << ans << endl;
    for (auto [p,x]: M) {
        if (keep[x]) cout << p.first+1 << " " << p.second+1 << endl;
    }


    return 0;
}