#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
template<class T> void check_min(T &a, const T &b){ a = (a < b) ? a : b; }
template<class T> void check_max(T &a, const T &b){ a = (a > b) ? a : b; }
#define all(x) (x).begin(), (x).end()

vector<pair<int, int>> solve(int n, int m){
    vector<pair<int, int>> v;
    while(m >= 2 * n){
        for(int i = 1; i <= n; ++i){
            v.push_back({i, m});
        }
        m -= n;
    }

    if(m == n){
        for(int i = 1; i <= n; ++i)
            v.push_back({i, 1});
        for(int i = 2; i <= n - 1; ++i)
            v.push_back({i, n});
    }
    else{
        for(int i = 1; i <= n; ++i)
            v.push_back({i, 1});
        for(int i = 1; i <= n; ++i)
            v.push_back({i, m});

        int mid = (1 + m) / 2;
        for(int i = 1; i <= n; ++i){
            int diff = m - mid;
            int diff2 = mid - 1;
            diff = min(diff, diff2);
            // cout << diff << " diff " << n - diff << " " << i <<  " " << 1 + diff << endl;
            if(i > n - diff && i < 1 + diff){
                v.push_back({i, mid});
            }
        }
    }
    return v;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m;
    cin >> n >> m;

    vector<pair<int, int>> v;
    if(n < m){
        v = solve(n, m);
    }
    else{
        v = solve(m, n);
        for(auto &[x, y]: v)
            swap(x, y);
    }

    /*for(auto [x, y]: v){
        assert(1 <= x && x <= n);
        assert(1 <= y && y <= m);
    }

    for(int i = 0; i < v.size(); ++i){
        auto [x, y] = v[i];
        for(int j = i + 1; j < v.size(); ++j){
            auto [x2, y2] = v[j];

            int sum_1 = x + y;
            int sum_2 = x2 + y2;
            assert(sum_1 != sum_2);
            int diff_1 = x - y;
            int diff_2 = x2 - y2;
            assert(diff_1 != diff_2);
        }
    }*/

    cout << v.size() << "\n";
    for(auto [x, y]: v)
        cout << x << " " << y << "\n";
}