#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
inline long long getnum() {
  char c = getchar();
  long long num, sign = 1;
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') sign = -1;
  for (num = 0; c >= '0' && c <= '9';) {
    c -= '0';
    num = num * 10 + c;
    c = getchar();
  }
  return num * sign;
}
inline long long power(long long a, long long b) {
  long long multiply = 1;
  for (int i = (0); i < (b); i++) {
    multiply *= a;
  }
  return multiply;
}
int n, m;
int main() {
  int test, cases = 1;
  cin >> n >> m;
  if ((n == 1 && m > 2) || (m == 1 && n > 2)) {
    cout << 1 << "\n";
    cout << n << " " << m << " " << 1 << " " << 1 << "\n";
  } else if (n % 2 == 0 || m % 2 == 0)
    cout << 0 << "\n";
  if (n % 2 == 0) {
    for (int i = 1; i <= n; i++) cout << i << " " << 1 << "\n";
    for (int i = n; i >= 1; i--) {
      if (i % 2 == 0) {
        for (int j = 2; j <= m; j++) cout << i << " " << j << "\n";
      } else {
        for (int j = m; j >= 2; j--) cout << i << " " << j << "\n";
      }
    }
    cout << 1 << " " << 1 << "\n";
    return 0;
  }
  if (m % 2 == 0) {
    for (int i = 1; i <= m; i++) cout << 1 << " " << i << "\n";
    for (int i = m; i >= 1; i--) {
      if (i % 2 == 0) {
        for (int j = 2; j <= n; j++) cout << j << " " << i << "\n";
      } else {
        for (int j = n; j >= 2; j--) cout << j << " " << i << "\n";
      }
    }
    cout << 1 << " " << 1 << "\n";
    return 0;
  }
  if (n > 1 && m > 1) {
    cout << 1 << "\n";
    cout << 1 << " " << m << " " << 1 << " " << 1 << "\n";
  }
  for (int i = 1; i <= n; i++) cout << i << " " << 1 << "\n";
  for (int i = n; i >= 1; i--) {
    if (i % 2) {
      for (int j = 2; j <= m; j++) cout << i << " " << j << "\n";
    } else {
      for (int j = m; j >= 2; j--) cout << i << " " << j << "\n";
    }
  }
  cout << 1 << " " << 1 << "\n";
  return 0;
}
