#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
 
int n;
int m;
map<int, bool> mp1, mp2;
 
void solve()
{
    cin >> n >> m;


    bool isRev = false;
    if(n > m) {
        swap(n, m);
        isRev = true;
    }
    vector<pair<int, int>> res;

    if (n == m) {
        for (int i = 1; i <= n; i++) {
            res.pb({1, i});
        }
        for (int i = 2; i <= n - 1; i++) {
            res.pb({n, i});
        }
    }
    else {
        int j = 1;
        int l = 1, r = n;
        while (j <= m) {
            int nextJ = 0;
            for (int i = l; i <= r; i++) {
                if (mp1[i + j] == true || mp2[i - j] == true) continue;
                res.pb({i, j});
                mp1[i + j] = mp2[i - j] = true;
                maximize(nextJ, j + min(n - i, m - j));
                maximize(nextJ, j + min(i - 1, m - j));
            } 
            j = nextJ + 1;
        }
    }


    cout << sz(res) << endl;
    for (auto it : res) {
        cout << it.fi << ' ' << it.se << endl;
    }
    
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // freopen(TASK".inp" , "r" , stdin);
    // freopen(TASK".out" , "w" , stdout);
 
    int tc = 1;
    //cin >> tc;
    while(tc--) {
        solve();
    }
    return 0;
}