#include <bits/stdc++.h>
template <class T>
typename T::value_type arr_sum(const T& v, int n) {
  typename T::value_type sum = 0;
  for (int i = 0; i < n; ++i) sum += v[i];
  return sum;
}
template <class T>
long long arr_count(const T& v, int n, int t) {
  long long count = 0;
  for (int i = 0; i < n; ++i) count += (v[i] == t);
  return count;
}
template <class T>
typename T::value_type arr_maxi(const T& v, int n) {
  typename T::value_type maxi = 0;
  for (int i = 1; i < n; ++i)
    if (v[maxi] < v[i]) maxi = i;
  return maxi;
}
template <class T>
typename T::value_type arr_mini(const T& v, int n) {
  typename T::value_type mini = 0;
  for (int i = 1; i < n; ++i)
    if (v[mini] > v[i]) mini = i;
  return mini;
}
template <class T>
typename T::value_type arr_max(const T& v, int n) {
  typename T::value_type max = v[0];
  for (int i = 1; i < n; ++i)
    if (max < v[i]) max = v[i];
  return max;
}
template <class T>
typename T::value_type arr_min(const T& v, int n) {
  typename T::value_type min = v[0];
  for (int i = 1; i < n; ++i)
    if (min > v[i]) min = v[i];
  return min;
}
using namespace std;
int main() {
  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 0;
  }
  if (m == 0) {
    cout << "1 0" << endl;
    cout << n << " 0" << endl;
    cout << "0 0" << endl;
    cout << n - 1 << " 0" << endl;
    return 0;
  }
  int f = 0;
  if (m > n) {
    f = 1;
    swap(m, n);
  }
  long double maxres = 0.0;
  vector<pair<int, int>> res(4, {0.0, 0.0});
  long double d2;
  for (int i = 1; i < m + 1; ++i) {
    for (int j = 0; j < m; ++j) {
      long double d1 = sqrt((long double)n * n + abs(i - j) * abs(i - j)) +
                       sqrt((long double)(m - i) * (m - i) + n * n);
      long double d2 = sqrt((long double)n * n + j * j) +
                       sqrt((long double)(m - i) * (m - i) + n * n);
      if (d1 > maxres) {
        maxres = d1;
        res[0] = make_pair(0, 0);
        res[1] = make_pair(n, m);
        res[2] = make_pair(0, i);
        res[3] = make_pair(n, j);
      }
      if (d2 > maxres) {
        maxres = d2;
        res[0] = make_pair(n, j);
        res[1] = make_pair(0, 0);
        res[2] = make_pair(n, m);
        res[3] = make_pair(0, i);
      }
    }
  }
  if (!f) {
    for (auto i : res) {
      cout << i.first << " " << i.second << endl;
    }
  } else {
    for (auto i : res) {
      cout << i.second << " " << i.first << endl;
    }
  }
}

### Prompt

Your task is to create a cpp solution to the following problem:

You are given a rectangular grid of lattice points from (0, 0) to (n, m) inclusive. You have to choose exactly 4 different points to build a polyline possibly with self-intersections and self-touching. This polyline should be as long as possible.

A polyline defined by points p1, p2, p3, p4 consists of the line segments p1 p2, p2 p3, p3 p4, and its length is the sum of the lengths of the individual line segments.

Input

The only line of the input contains two integers n and m (0 ≤ n, m ≤ 1000). It is guaranteed that grid contains at least 4 different points.

Output

Print 4 lines with two integers per line separated by space — coordinates of points p1, p2, p3, p4 in order which represent the longest possible polyline.

Judge program compares your answer and jury's answer with 10 - 6 precision.

Examples

Input

1 1


Output

1 1
0 0
1 0
0 1


Input

0 10


Output

0 1
0 10
0 0
0 9

### Response

```cpp
#include <bits/stdc++.h>
template <class T>
typename T::value_type arr_sum(const T& v, int n) {
  typename T::value_type sum = 0;
  for (int i = 0; i < n; ++i) sum += v[i];
  return sum;
}
template <class T>
long long arr_count(const T& v, int n, int t) {
  long long count = 0;
  for (int i = 0; i < n; ++i) count += (v[i] == t);
  return count;
}
template <class T>
typename T::value_type arr_maxi(const T& v, int n) {
  typename T::value_type maxi = 0;
  for (int i = 1; i < n; ++i)
    if (v[maxi] < v[i]) maxi = i;
  return maxi;
}
template <class T>
typename T::value_type arr_mini(const T& v, int n) {
  typename T::value_type mini = 0;
  for (int i = 1; i < n; ++i)
    if (v[mini] > v[i]) mini = i;
  return mini;
}
template <class T>
typename T::value_type arr_max(const T& v, int n) {
  typename T::value_type max = v[0];
  for (int i = 1; i < n; ++i)
    if (max < v[i]) max = v[i];
  return max;
}
template <class T>
typename T::value_type arr_min(const T& v, int n) {
  typename T::value_type min = v[0];
  for (int i = 1; i < n; ++i)
    if (min > v[i]) min = v[i];
  return min;
}
using namespace std;
int main() {
  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 0;
  }
  if (m == 0) {
    cout << "1 0" << endl;
    cout << n << " 0" << endl;
    cout << "0 0" << endl;
    cout << n - 1 << " 0" << endl;
    return 0;
  }
  int f = 0;
  if (m > n) {
    f = 1;
    swap(m, n);
  }
  long double maxres = 0.0;
  vector<pair<int, int>> res(4, {0.0, 0.0});
  long double d2;
  for (int i = 1; i < m + 1; ++i) {
    for (int j = 0; j < m; ++j) {
      long double d1 = sqrt((long double)n * n + abs(i - j) * abs(i - j)) +
                       sqrt((long double)(m - i) * (m - i) + n * n);
      long double d2 = sqrt((long double)n * n + j * j) +
                       sqrt((long double)(m - i) * (m - i) + n * n);
      if (d1 > maxres) {
        maxres = d1;
        res[0] = make_pair(0, 0);
        res[1] = make_pair(n, m);
        res[2] = make_pair(0, i);
        res[3] = make_pair(n, j);
      }
      if (d2 > maxres) {
        maxres = d2;
        res[0] = make_pair(n, j);
        res[1] = make_pair(0, 0);
        res[2] = make_pair(n, m);
        res[3] = make_pair(0, i);
      }
    }
  }
  if (!f) {
    for (auto i : res) {
      cout << i.first << " " << i.second << endl;
    }
  } else {
    for (auto i : res) {
      cout << i.second << " " << i.first << endl;
    }
  }
}

```