#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep1(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < (t); ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define em emplace
#define pob pop_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define newline puts("")
#define vc vector
using namespace std;
template<class T> using vv = vc<vc<T>>;
template<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;
using uint = unsigned; using ull = unsigned long long;
using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;
using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;
int geti(){int x;cin>>x;return x;}
vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}
template<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<class T>string join(const T&v,const string&d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}
template<class T>ostream& operator<<(ostream&o,const vv<T>&v){for(auto&r:v)o<<r<<'\n';return o;}
template<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}
template<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}
template<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}
template<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}
template<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}
template<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}
template<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}
template<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}
template<class T1,class T2>pair<T1,T2>operator*(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi*b.fi,a.se*b.se};}
template<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}
template<class T1,class T2>void operator+=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi+=b.fi;a.se+=b.se;}
template<class T1,class T2>void operator-=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi-=b.fi;a.se-=b.se;}
template<class T1,class T2>void operator*=(pair<T1,T2>&a,const pair<T1,T2>&b){a.fi*=b.fi;a.se*=b.se;}
template<class T>void operator*=(pair<T,T>&a,T b){a.fi*=b;a.se*=b;}
template<class T1,class T2>void operator+=(vc<T1>&a,T2 b){for(T1&x:a)x+=b;}
template<class T1,class T2>void operator-=(vc<T1>&a,T2 b){for(T1&x:a)x-=b;}
template<class T1,class T2>void operator*=(vc<T1>&a,T2 b){for(T1&x:a)x*=b;}
template<class T1,class T2>void operator/=(vc<T1>&a,T2 b){for(T1&x:a)x/=b;}
template<class T1,class T2>void operator%=(vc<T1>&a,T2 b){for(T1&x:a)x%=b;}
template<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}
template<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}
template<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}
template<class T>T min(const vc<T>&a){return *min_element(rng(a));}
template<class T>T max(const vc<T>&a){return *max_element(rng(a));}
template<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}
template<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}
template<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}
template<class T1,class T2>void prepend(vc<T1>&a,const T2&x){a.insert(a.begin(),x);}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { cout<<"-1"<<'\n'; return;}
#define yes { cout<<"Yes"<<'\n'; return;}
#define ye { cout<<"Yes"<<'\n';}
#define no { cout<<"No"<<'\n'; return;}
#define yn {cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';}
#define rtn(x) { cout<<(x)<<'\n'; return;} // flush!
#define endl '\n'

struct D {
  int i, j, c;
  D(int i=0, int j=0, int c=0):i(i),j(j),c(c) {}
  bool operator<(const D& _) const { return i<_.i;}
};
ostream& operator<<(ostream&o,const D&a){return o<<a.i+1<<" "<<a.j+1<<" "<<a.c;}
struct S {
  D a, b;
  S() {}
  S(D a, D b):a(a),b(b) {}
};

struct Solver {
  vc<S>& flip(vc<S>& s) {
    for (auto& [a,b] : s) {
      swap(a.i,a.j);
      swap(b.i,b.j);
    }
    return s;
  }
  vc<S> solve(int h, int w) {
    if (h > w) {
      auto s = solve(w,h);
      return flip(s);
    }
    vc<S> s;
    if (h == 1) {
      int c = 1;
      for (int j = 0; j < w; j += 2) {
        s.eb(D(0,j,c),D(0,j+1,c+1));
        c++;
      }
      return s;
    }
    if (h == 2) {
      rep(j,w) s.eb(D(0,j,1),D(1,j,2));
      return s;
    }
    if (h == 3) {
      // not proofed. (dp nara tokeruga)
      rep(j,w) s.eb(D(1,j,1),D(2,j,2));
      int c = 3;
      for (int j = 0; j < w; j += 2) {
        if (j%4) {
          s.eb(D(0,j,c),D(0,j+1,1));
          c++;
        } else {
          s.eb(D(0,j,1),D(0,j+1,c));
        }
      }
      return s;
    }
    if (h == 5) {
      // 5x6 de manzoku siteta. dameyanke
      // not proofed. (dp nara tokeruga)
      if (w <= 8) {
        rep(j,w) s.eb(D(3,j,1),D(4,j,2));
        int c = 3;
        for (int j = 0; j < w; j += 2) {
          if (j%8 == 0) {
            rep(i,3) s.eb(D(i,j,1),D(i,j+1,c));
          } else if (j == w-2 || j%8 == 6) {
            rep(i,3) s.eb(D(i,j,c),D(i,j+1,1));
            c++;
          } else {
            s.eb(D(0,j,c),D(1,j,1));
            s.eb(D(0,j+1,c),D(1,j+1,1));
            if (j%8 == 2) s.eb(D(2,j,c),D(2,j+1,1));
            else s.eb(D(2,j,1),D(2,j+1,c));
          }
        }
      } else {
        rep(j,w) s.eb(D(1,j,1),D(0,j,3));
        rep(j,w) s.eb(D(3,j,2),D(4,j,4));
        for (int j = 0; j < w; j += 2) {
          s.eb(D(2,j,1),D(2,j+1,2));
        }
      }
      return s;
    }

    bool fl = false;
    if (h&1) {
      swap(h,w); fl = true;
    }
    rep(i,h) s.eb(D(i,w-2,1),D(i,w-1,3));
    w -= 2;
    rep(j,w) s.eb(D(0,j,1),D(1,j,2));
    rep(j,w) s.eb(D(h-1,j,1),D(h-2,j,2));
    if (6 <= h) {
      srep(i,2,h-2) s.eb(D(i,0,2),D(i,1,1));
      srep(j,2,w) s.eb(D(2,j,2),D(3,j,1));
      if (8 <= h) {
        srep(i,4,h-2) s.eb(D(i,2,1),D(i,3,2));
        for (int i = 4; i < h-2; i += 2) {
          srep(j,4,w) s.eb(D(i,j,1),D(i+1,j,2));
        }
      }
    }
    if (fl) flip(s);
    return s;
  }
  void solve() {
    int h,w;
    cin>>h>>w;
    auto s = solve(h,w);
    {
      set<int> cs;
      for (auto x : s) cs.em(x.a.c), cs.em(x.b.c);
      cout<<sz(cs)<<endl;
    }
    for (auto x : s) {
      cout<<x.a<<" "<<x.b<<endl;
    }
  }
};

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int ts = 1;
  // cin >> ts;
  rep1(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}