#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 10;

pair<int, int> a[N];

void solve() {
    int n, m;
    scanf("%d %d", &n, &m);

    int cnt = 0;
    if(n <= m) {
        int k = (m + n - 1) / n;
        for(int i = 1; i <= k; i++) {
            for(int j = 1; j <= n; j++) {
                a[++cnt] = {j, n * (i - 1) + 1};
            }
        }
        int kk = m % n;
        if(kk == 0) kk = n;
        kk = n + 1 - kk;
        for(int i = kk + 1; i <= n - kk; i++) a[++cnt] = {i, m};
    }
    else {
        int k = (n + m - 1) / m;
        for(int i = 1; i <= k; i++) {
            for(int j = 1; j <= m; j++) {
                a[++cnt] = {m * (i - 1) + 1, j};
            }
        }
        int kk = n % m;
        if(kk == 0) kk = m;
        kk = m + 1 - kk;
        for(int i = kk + 1; i <= m - kk; i++) a[++cnt] = {n, i};
    }
    printf("%d\n", cnt);
    for(int i = 1; i <= cnt; i++) printf("%d %d\n", a[i].first, a[i].second);
}

int main() {
    int T = 1;
    while(T--) solve();
}