#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T Abs(T a) {
  return a > 0 ? a : -a;
}
template <typename T>
inline T sqr(T a) {
  return a * a;
}
template <typename T>
inline void relaxMin(T &a, T b) {
  if (b < a) a = b;
}
template <typename T>
inline void relaxMax(T &a, T b) {
  if (b > a) a = b;
}
const int INF = (int)1E9;
const long double EPS = 1E-6;
const long double PI = 3.1415926535897932384626433832795;
void solve() {
  int n, m;
  cin >> n >> m;
  if (n == 0) {
    cout << 0 << " " << 1 << endl;
    cout << 0 << " " << m << endl;
    cout << 0 << " " << 0 << endl;
    cout << 0 << " " << (m - 1) << endl;
    return;
  }
  if (m == 0) {
    cout << 1 << " " << 0 << endl;
    cout << n << " " << 0 << endl;
    cout << 0 << " " << 0 << endl;
    cout << (n - 1) << " " << 0 << endl;
    return;
  }
  if (n <= m) {
    double v1 = 2 * sqrt((n - 1) * (n - 1) + m * m + .0);
    double v2 = m + sqrt(n * n + m * m + .0);
    if (v1 > v2) {
      printf("%d %d\n", 1, 0);
      printf("%d %d\n", n, m);
      printf("%d %d\n", 0, 0);
      printf("%d %d\n", n - 1, m);
    } else {
      printf("%d %d\n", 0, 0);
      printf("%d %d\n", n, m);
      printf("%d %d\n", n, 0);
      printf("%d %d\n", 0, m);
    }
  } else {
    double v1 = 2 * sqrt((m - 1) * (m - 1) + n * n + .0);
    double v2 = n + sqrt(n * n + m * m + .0);
    if (v1 > v2) {
      printf("%d %d\n", 0, 1);
      printf("%d %d\n", n, m);
      printf("%d %d\n", 0, 0);
      printf("%d %d\n", n, m - 1);
    } else {
      printf("%d %d\n", 0, 0);
      printf("%d %d\n", n, m);
      printf("%d %d\n", 0, m);
      printf("%d %d\n", n, 0);
    }
  }
}
int main() {
  solve();
  return 0;
}
