#include using namespace std; //高速化 struct ponjuice{ponjuice(){cin.tie(0);ios::sync_with_stdio(0);cout<= 0; i--) #define per2(i, n) for(ll i = n-1; i >= 0; i--) #define per3(i, a, b) for(ll i = b-1; i >= a; i--) #define per4(i, a, b, step) for(ll i = b-1; i >= a; i-= step) #define per(...) overload4(__VA_ARGS__, per4, per3, per2, per1)(__VA_ARGS__) //関数 #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() templateinline bool chmax(S& a, T b){return a < b && ( a = b , true);} templateinline bool chmin(S& a, T b){return a > b && ( a = b , true);} //定数 constexpr ll mod = 998244353; constexpr ll minf=-(1<<29); constexpr ll inf=(1<<29); constexpr ll MINF=-(1LL<<60); constexpr ll INF=(1LL<<60); const int dx[4] ={-1, 0, 1, 0}; const int dy[4] ={ 0, 1, 0,-1}; const int dx8[8] ={-1,-1,-1, 0, 1, 1, 1, 0}; const int dy8[8] ={-1, 0, 1, 1, 1, 0,-1,-1}; void solve(); int main() { int t = 1; // cin >> t; while(t--)solve(); } void solve(){ int h,w; cin >> h >> w; cout << h * w / 2 << endl; if(h == 2) { rep(i,0,w){ cout << 1 << " " << i+1 << " " << 1 << " " << 2 << " " << i+1 << " " << 2 << " " << endl; } return; } if(w == 2) { rep(i,0,h){ cout << i+1 << " " << 1 << " " << 1 << " " << i+1 << " " << 2 << " " << 2 << " " << endl; } return; } if(h == 4) { rep(i,0,w){ cout << 1 << " " << i+1 << " " << 1 << " " << 2 << " " << i+1 << " " << 2 << " " << endl; cout << 3 << " " << i+1 << " " << 2 << " " << 4 << " " << i+1 << " " << 3 << " " << endl; } return; } if(w == 4) { rep(i,0,h){ cout << i+1 << " " << 1 << " " << 1 << " " << i+1 << " " << 2 << " " << 2 << " " << endl; cout << i+1 << " " << 3 << " " << 2 << " " << i+1 << " " << 4 << " " << 3 << " " << endl; } return; } rep(i,0,w){ cout << 1 << " " << i+1 << " " << 1 << " " << 2 << " " << i+1 << " " << 2 << " " << endl; } rep(i,0,w){ cout << h << " " << i+1 << " " << 4 << " " << h-1 << " " << i+1 << " " << 3 << " " << endl; } rep(i,2,h-2){ rep(j,0,w/2){ int a = 2,b = 3; cout << i+1 << " " << j*2+1 << " " << a << " " << i+1 << " " << j*2+2 << " " << b << " " << endl; } } }