//https://qoj.ac/contest/1356/problem/7178
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define PI acos(-1)
#define LSB(i) ((i) & -(i))
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define sc second
#define th third
#define fo fourth
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
#define INF 1e15
#define MOD 1000000007
#define endl "\n"

#define all(data)       data.begin(),data.end()
#define TYPEMAX(type)   std::numeric_limits<type>::max()
#define TYPEMIN(type)   std::numeric_limits<type>::min()
#define MAXN 100007
vector<pll> v;
int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    ll n,m,x=0; cin>>n>>m;
    if(n>m) {swap(n,m); x^=1;}
    if(n==m)
    {
        for(int i=2;i<n;i++) v.pb({i,m});
        for(int i=1;i<=n;i++) v.pb({i,1});
    }
    else if(n%2==0)
    {

        for(int i=1;i<=n;i++) v.pb({i,1});
        for(int i=n/2-(m-1)%n/2+1; i<=(m-1)%n/2+n/2;i++) v.pb({i,(m-1)%n/2+n/2+1});
        for(int i=1; i<=n;i++)
        {
            for(int j=1+n+(m-1)%n;j<=m;j+=n) v.pb({i,j});
        }
    }
    else
    {
        for(int j=(n+1)/2+1;j<=m-(n+1)/2;j++) v.pb({(n+1)/2,j});
        for(int i=1;i<=n;i++) v.pb({i,1}),v.pb({i,m});
    }
    if(x)
    {
        for(auto &[mm,dd]:v) swap(mm,dd);
    }
    cout<<v.size()<<endl;
    for(auto [mm,dd]:v) cout<<mm<<" "<<dd<<endl;
    return 0;
}