#include<algorithm>
#include<iostream>
#include<string>
#include<string.h>
#include<array>
#include<cmath>
#include<iterator>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<vector>
#include<cfloat>
#include<climits>
#include<complex>
#include<deque>
#include<fstream>
#include<functional>
#include<iomanip>
#include<list>
#include<memory>
#include<stack>
#include<random>
using namespace std;

int main() {
    int n,m;
    cin >> n >> m;
    if(n == m) {
        if(n == 1) {
            cout << 1 << "\n";
            cout << 1 << " " << 1 << "\n";
        }
        else {
            cout << n+m-2 << "\n";
            for(int i = 1; i <= n; i++) {
                cout << i << " " << 1 << "\n";
            }
            for(int i = 2; i <= n-1; i++) {
                cout << i << " " << n << "\n";
            }
        }
        return 0;
    }
    vector<pair<int,int>>tmp;
    bool flag = false;
    if(n > m) {
        flag = true;
        swap(n,m);
    }
    for(int i = 1; i <= n; i++) {
        tmp.push_back({i,1});
        tmp.push_back({i,m});
    }
    if(n%2 == 1) {
        int res = m-n-1;
        for(int i = (m+1)/2-(res-1)/2; i <= (m+1)/2+res/2; i++) {
            tmp.push_back({(n+1)/2,i});
        }
    }
    else {
        int res = m-n-1;
        res /= 2;
        int mi = (m+1)/2-(res-1);
        for(int i = 0; i < res; i++) {
            tmp.push_back({n/2,mi+i*2});
            tmp.push_back({n/2+1,mi+i*2});
        }
    }
    cout << tmp.size() << "\n";
    for(auto i:tmp) {
        if(flag) {
            swap(i.first,i.second);
        }
        cout << i.first << " " << i.second << "\n";
    }
}