#include "bits/stdc++.h"
using namespace std;

vector<pair<int, int>> solve(int maior, int menor) {
    vector<pair<int, int>> resp;
    for(int i=0; i<=(maior-1)/menor; i++) {
        for(int j=0; j<menor; j++) {
            // cout << i * menor + 1 << ", " << j + 1 << endl; 
            resp.push_back({i * menor + 1, j + 1});
        }
    }

    // cout << menor - 2 * (menor - ((maior-1) % menor)) << endl;
    int last = menor - ((maior-1) % menor);
    for(int i=last; i<menor-last; i++) {
        // cout << maior + 1 << ", " << i + 1 << endl;
        resp.push_back({maior, i + 1});
    }

    return resp;
}

int main(void){
    ios_base::sync_with_stdio(false), cin.tie(nullptr);

    int N, M; cin >> N >> M;
    int maior = max(N, M), menor = min(N, M);

    if(maior > menor) {

        vector<pair<int, int>> resp1 = solve(maior/2, menor);
        vector<pair<int, int>> resp2 = solve(maior-(maior/2), menor);

        cout << int(resp1.size()) + int(resp2.size()) << endl;
        for(auto &p: resp1) {
            pair<int, int> p2 = (menor == M ? make_pair(p.first, p.second) : make_pair(p.second, p.first)); 
            cout << p2.first << " " << p2.second << endl;
        }
        for(auto &p: resp2) {
            pair<int, int> p2 = (menor == M ? make_pair(maior-p.first+1, p.second) : make_pair(p.second, maior-p.first+1)); 
            cout << p2.first << " " << p2.second << endl;
        }
    
    } else {

        vector<pair<int, int>> resp1 = solve(maior, menor);

        cout << int(resp1.size()) << endl;
        for(auto &p: resp1) {
            pair<int, int> p2 = (menor == M ? make_pair(p.first, p.second) : make_pair(p.second, p.first)); 
            cout << p2.first << " " << p2.second << endl;
        }

    }

}