#include <bits/stdc++.h>
using namespace std;
void solve(int n, int 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 t1 = sqrt((n - 1) * (n - 1) + m * m + 0.0) * 2;
    double t2 = sqrt(n * n + m * m + 0.0) + m;
    if (t1 < t2) {
      cout << 0 << " " << 0 << endl;
      cout << n << " " << m << endl;
      cout << n << " " << 0 << endl;
      cout << 0 << " " << m << endl;
      return;
    }
    cout << 1 << " " << 0 << endl;
    cout << n << " " << m << endl;
    cout << 0 << " " << 0 << endl;
    cout << n - 1 << " " << m << endl;
    return;
  }
  double t1 = sqrt((m - 1) * (m - 1) + n * n + 0.0) * 2;
  double t2 = sqrt(m * m + n * n + 0.0) + n;
  if (t1 < t2) {
    cout << 0 << " " << 0 << endl;
    cout << n << " " << m << endl;
    cout << 0 << " " << m << endl;
    cout << n << " " << 0 << endl;
    return;
  }
  cout << 0 << " " << 1 << endl;
  cout << n << " " << m << endl;
  cout << 0 << " " << 0 << endl;
  cout << n << " " << m - 1 << endl;
}
int main() {
  int n, m;
  while (cin >> n >> m) {
    solve(n, m);
  }
  return 0;
}
