#include <bits/stdc++.h>
using namespace std;
using namespace std;
int n, m;
bool esta[1003][1003];
long long dista(pair<long long, long long> A, pair<long long, long long> B) {
  long long x1 = A.first;
  long long x2 = B.first;
  long long yy1 = A.second;
  long long yy2 = B.second;
  return (x1 - x2) * (x1 - x2) + (yy1 - yy2) * (yy1 - yy2);
}
long long cal(vector<pair<long long, long long> > v) {
  long long res = 0;
  for (int i = 0; i < v.size() - 1; i++) res += dista(v[i], v[i + 1]);
  return res;
}
int main() {
  cin >> n >> m;
  if (n == 0 || m == 0) {
    if (n == 0) {
      cout << 0 << " " << 1 << endl;
      cout << 0 << " " << m << endl;
      cout << 0 << " " << 0 << endl;
      cout << 0 << " " << m - 1 << endl;
    } else {
      cout << 1 << " " << 0 << endl;
      cout << n << " " << 0 << endl;
      cout << 0 << " " << 0 << endl;
      cout << n - 1 << " " << 0 << endl;
    }
    return 0;
  }
  if (n >= m) {
    long long d1 = 0;
    long long d2 = 0;
    vector<pair<long long, long long> > v1;
    v1.push_back(make_pair(0, m));
    v1.push_back(make_pair(n, 0));
    v1.push_back(make_pair(0, 0));
    v1.push_back(make_pair(n, m));
    vector<pair<long long, long long> > v2;
    v2.push_back(make_pair(0, 1));
    v2.push_back(make_pair(n, m));
    v2.push_back(make_pair(0, 0));
    v2.push_back(make_pair(n, m - 1));
    d1 = cal(v1);
    d2 = cal(v2);
    if (d1 > d2) {
      cout << 0 << " " << m << endl;
      cout << n << " " << 0 << endl;
      cout << 0 << " " << 0 << endl;
      cout << n << " " << m << endl;
    } else {
      cout << 0 << " " << 1 << endl;
      cout << n << " " << m << endl;
      cout << 0 << " " << 0 << endl;
      cout << n << " " << m - 1 << endl;
    }
  } else {
    long long d1 = 0;
    long long d2 = 0;
    vector<pair<long long, long long> > v1;
    v1.push_back(make_pair(0, 0));
    v1.push_back(make_pair(n, m));
    v1.push_back(make_pair(n, 0));
    v1.push_back(make_pair(0, m));
    vector<pair<long long, long long> > v2;
    v2.push_back(make_pair(1, 0));
    v2.push_back(make_pair(n, m));
    v2.push_back(make_pair(0, 0));
    v2.push_back(make_pair(n - 1, m));
    d1 = cal(v1);
    d2 = cal(v2);
    if (d1 > d2) {
      cout << 0 << " " << 0 << endl;
      cout << n << " " << m << endl;
      cout << n << " " << 0 << endl;
      cout << 0 << " " << m << endl;
    } else {
      cout << 1 << " " << 0 << endl;
      cout << n << " " << m << endl;
      cout << 0 << " " << 0 << endl;
      cout << n - 1 << " " << m << endl;
    }
  }
  return 0;
}
