#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 10;
const int MOD = 1e9 + 7;
void solve() {
  int n, m;
  cin >> n >> m;
  int s = false;
  if (n > m) {
    s = true;
    swap(n, m);
  }
  vector<pair<int, int> > ret;
  if (n == 0) {
    ret.push_back(make_pair(0, 1));
    ret.push_back(make_pair(0, m));
    ret.push_back(make_pair(0, 0));
    ret.push_back(make_pair(0, m - 1));
  } else {
    double a = sqrt(n * n + m * m) * 2 + max(n, m);
    double b = sqrt(n * n + m * m) + sqrt(m * m + (n - 1) * (n - 1)) * 2;
    if (a > b) {
      ret.push_back(make_pair(0, 0));
      ret.push_back(make_pair(n, m));
      ret.push_back(make_pair(n, 0));
      ret.push_back(make_pair(0, m));
    } else {
      ret.push_back(make_pair(1, 0));
      ret.push_back(make_pair(n, m));
      ret.push_back(make_pair(0, 0));
      ret.push_back(make_pair(n - 1, m));
    }
  }
  for (int i = 0; i < 4; ++i) {
    if (s) swap(ret[i].first, ret[i].second);
    cout << ret[i].first << ' ' << ret[i].second << endl;
  }
}
int main() {
  solve();
  return 0;
}
