Problem: You are given n points with integer coordinates on the plane. Points are given in a way such that there is no triangle, formed by any three of these n points, which area exceeds S.

Alyona tried to construct a triangle with integer coordinates, which contains all n points and which area doesn't exceed 4S, but, by obvious reason, had no success in that. Please help Alyona construct such triangle. Please note that vertices of resulting triangle are not necessarily chosen from n given points.

Input

In the first line of the input two integers n and S (3 ≤ n ≤ 5000, 1 ≤ S ≤ 1018) are given — the number of points given and the upper bound value of any triangle's area, formed by any three of given n points.

The next n lines describes given points: ith of them consists of two integers xi and yi ( - 108 ≤ xi, yi ≤ 108) — coordinates of ith point.

It is guaranteed that there is at least one triple of points not lying on the same line.

Output

Print the coordinates of three points — vertices of a triangle which contains all n points and which area doesn't exceed 4S.

Coordinates of every triangle's vertex should be printed on a separate line, every coordinate pair should be separated by a single space. Coordinates should be an integers not exceeding 109 by absolute value.

It is guaranteed that there is at least one desired triangle. If there is more than one answer, print any of them.

Example

Input

4 1
0 0
1 0
0 1
1 1


Output

-1 0
2 0
0 2

Note

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
void Print() { cout << endl; }
template <typename T1, typename... T>
void Print(const T1 &t1, const T &...t) {
  cout << t1 << " ";
  Print(t...);
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <class Iterator>
ostream &output_cantainer(ostream &os, Iterator first, Iterator last,
                          bool space = true) {
  if (space) {
    for (Iterator it = first; it != last; it++) {
      os << (*it) << ' ';
    }
    os << endl;
  } else
    for (Iterator it = first; it != last; it++) {
      os << (*it) << endl;
    }
  return os;
}
struct BigInt {
  static const int base = 1e9;
  static const int base_digits = 9;
  vector<int> z;
  int sign;
  BigInt() : sign(1) {}
  BigInt(long long v) : sign(1) {
    if (v < 0) sign = -1, v = -v;
    for (; v > 0; v = v / base) z.push_back(v % base);
  }
  BigInt(const string &s) { read(s); }
  BigInt(const BigInt &rhs) : z(rhs.z), sign(rhs.sign) {}
  friend void swap(BigInt &lhs, BigInt &rhs) {
    lhs.z.swap(rhs.z);
    std::swap(lhs.sign, rhs.sign);
  }
  void read(const string &s) {
    sign = 1;
    z.clear();
    int pos = 0, l = s.size();
    while (pos < l && (s[pos] == '+' || s[pos] == '-')) {
      if (s[pos] == '-') sign = -sign;
      ++pos;
    }
    for (int i = l - 1; i >= pos; i -= base_digits) {
      int x = 0;
      for (int j = max(pos, i - base_digits + 1); j <= i; j++) {
        x = x * 10 + s[j] - '0';
      }
      z.push_back(x);
    }
    trim();
  }
  BigInt &operator=(BigInt rhs) {
    swap(*this, rhs);
    return *this;
  }
  BigInt &operator=(long long v) {
    BigInt rhs(v);
    swap(*this, rhs);
    return *this;
  }
  BigInt operator+(const BigInt &rhs) {
    BigInt res(*this);
    res += rhs;
    return res;
  }
  BigInt &operator+=(const BigInt &rhs) {
    if (sign == rhs.sign) {
      for (int i = 0, carry = 0, u = max(z.size(), rhs.z.size());
           i < u || carry; i++) {
        if (i == z.size()) z.push_back(0);
        z[i] += carry + (i < (int)rhs.z.size() ? rhs.z[i] : 0);
        carry = z[i] >= base;
        if (carry) z[i] -= base;
      }
      return *this;
    }
    return (*this -= (-rhs));
  }
  BigInt operator-() const {
    BigInt res(*this);
    res.sign = -res.sign;
    return res;
  }
  BigInt operator-(const BigInt &rhs) const {
    BigInt res(*this);
    res -= rhs;
    return res;
  }
  BigInt &operator-=(const BigInt &rhs) {
    if (sign == rhs.sign) {
      if (abs() >= rhs.abs()) {
        for (int i = 0, carry = 0; i < (int)rhs.z.size() || carry; ++i) {
          z[i] -= carry + (i < (int)rhs.z.size() ? rhs.z[i] : 0);
          carry = z[i] < 0;
          if (carry) z[i] += base;
        }
        trim();
        return *this;
      }
      BigInt target(rhs - *this);
      target.neg();
      swap(*this, target);
      return *this;
    }
    return *this += (-rhs);
  }
  bool operator<(const BigInt &rhs) const {
    if (sign != rhs.sign) return sign < rhs.sign;
    if (z.size() != rhs.z.size())
      return (int)z.size() * sign < (int)rhs.z.size() * rhs.sign;
    for (int i = z.size() - 1; i >= 0; i--)
      if (z[i] != rhs.z[i]) return z[i] * sign < rhs.z[i] * sign;
    return false;
  }
  bool operator<=(const BigInt &rhs) const { return !(rhs < *this); }
  bool operator>=(const BigInt &rhs) const { return !(*this < rhs); }
  void neg() { sign = -sign; }
  void trim() {
    while (!z.empty() && z.back() == 0) z.pop_back();
    if (z.empty()) sign = 1;
  }
  bool isZero() const { return z.empty() || (z.size() == 1 && !z[0]); }
  BigInt abs() const {
    BigInt res(*this);
    res.sign *= res.sign;
    return res;
  }
  friend ostream &operator<<(ostream &os, const BigInt &v) {
    if (v.sign == -1) os << '-';
    os << ((v.z.empty()) ? 0 : v.z.back());
    for (int i = (int)v.z.size() - 2; i >= 0; --i)
      os << setw(base_digits) << setfill('0') << v.z[i];
    return os;
  }
  friend istream &operator>>(istream &is, BigInt &v) {
    string s;
    is >> s;
    v.read(s);
    return is;
  }
};
const int N = 5010;
int n, ch[N];
long long s, maxv;
struct Point {
  int x, y;
  bool operator<(const Point &rhs) const {
    if (x != rhs.x) return x < rhs.x;
    return y < rhs.y;
  }
} ps[N], pa, pb, pc;
long long cross_product(const Point &a, const Point &b) {
  return ((long long)a.x * b.y) - ((long long)a.y * b.x);
}
long long isleft(const Point &a, const Point &b, const Point &c) {
  Point p, o;
  p.x = b.x - a.x;
  p.y = b.y - a.y;
  o.x = c.x - b.x;
  o.y = c.y - b.y;
  return cross_product(p, o);
}
void solve() {
  sort(ps + 1, ps + n + 1);
  int total = 0;
  for (int i = 1; i <= n; i++) {
    while (total > 1 && isleft(ps[ch[total - 1]], ps[ch[total]], ps[i]) <= 0)
      total--;
    ch[++total] = i;
  }
  int t = total;
  for (int i = n - 1; i >= 1; i--) {
    while (total > t && isleft(ps[ch[total - 1]], ps[ch[total]], ps[i]) <= 0)
      total--;
    ch[++total] = i;
  }
  total--;
  for (int i = 1; i <= total; i++) {
    int k = i + 1;
    for (int j = i + 1; j <= total; j++) {
      while (isleft(ps[ch[i]], ps[ch[k + 1]], ps[ch[j]]) <
             isleft(ps[ch[i]], ps[ch[k]], ps[ch[j]])) {
        k++;
        if (k > total) k = 1;
      }
      long long a = abs(isleft(ps[ch[i]], ps[ch[j]], ps[ch[k]]));
      if (a > maxv) {
        maxv = a;
        pa.x = ps[ch[j]].x + ps[ch[k]].x - ps[ch[i]].x;
        pa.y = ps[ch[j]].y + ps[ch[k]].y - ps[ch[i]].y;
        pb.x = ps[ch[i]].x + ps[ch[j]].x - ps[ch[k]].x;
        pb.y = ps[ch[i]].y + ps[ch[j]].y - ps[ch[k]].y;
        pc.x = ps[ch[i]].x + ps[ch[k]].x - ps[ch[j]].x;
        pc.y = ps[ch[i]].y + ps[ch[k]].y - ps[ch[j]].y;
      }
    }
  }
}
int main() {
  scanf("%d%lld", &n, &s);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &ps[i].x, &ps[i].y);
  }
  solve();
  printf("%d %d\n%d %d\n%d %d\n", pa.x, pa.y, pb.x, pb.y, pc.x, pc.y);
}