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

int s(int n, int m)
{
    if (m%n==0)
        return 1;

    return 1+n-m%n;
}

int e(int n, int m)
{
    if (m%n==0)
        return n-1;

    return m%n-2;
}

int main()
{
    int m, n, i;
    vector<pair<int, int> > h, v;
    cin >> m >> n;
    for (i=0; i<m; i=i+n)
        for (int j=0; j<n; j++)
            h.push_back({i+1, j+1});
    int x=i-n;
    int y=n-1;
    while ((y-1)>=0 && (x+1)<m)
    {
        y=y-1;
        x=x+1;
    }
    for (int i=y+1; i<n-y-1; i++)
        h.push_back({m, i+1});
    swap(m, n);
    for (i=0; i<m; i=i+n)
        for (int j=0; j<n; j++)
            v.push_back({i+1, j+1});
    x=i-n;
    y=n-1;
    while ((y-1)>=0 && (x+1)<m)
    {
        y=y-1;
        x=x+1;
    }
    for (int i=y+1; i<n-y-1; i++)
        v.push_back({m, i+1});
    if (h.size()>v.size())
    {
        cout << h.size() << '\n';
        for (auto x : h)
            cout << x.first << ' ' << x.second << '\n';
    }
    else
    {
        cout << v.size() << '\n';
        for (auto x : v)
            cout << x.second << ' ' << x.first << '\n';
    }

    return 0;
}