#include <bits/stdc++.h>
using namespace std;
const int maxn = 5010;
const int inf = 0x3f3f3f3f;
const int modu = 1e9 + 7;
int t, n, m;
double sum, res, ans;
struct point {
  int x, y;
  point() {}
  point(int _x, int _y) : x(_x), y(_y) {}
  inline friend point operator-(const point &a, const point &b) {
    return point(a.x - b.x, a.y - b.y);
  }
  inline friend point operator+(const point &a, const point &b) {
    return point(a.x + b.x, a.y + b.y);
  }
  inline friend long long operator*(const point &a, const point &b) {
    return 1ll * a.x * b.y - 1ll * a.y * b.x;
  }
} a[maxn], A, B, C;
long long area(int i, int j, int k) {
  return abs((a[j] - a[i]) * (a[k] - a[i]));
}
int main() {
  cin >> n >> res;
  for (int i = 0; i < n; i++) {
    cin >> a[i].x >> a[i].y;
  }
  int p = 0, b = 1, c = 2;
  bool f = 1;
  res = area(p, b, c);
  while (f) {
    f = 0;
    for (int i = 0; i < n; i++) {
      long long tmp;
      tmp = area(p, b, i);
      if (tmp > res) {
        res = tmp;
        c = i;
        f = 1;
      }
      tmp = area(p, i, c);
      if (tmp > res) {
        res = tmp;
        b = i;
        f = 1;
      }
      tmp = area(i, b, c);
      if (tmp > res) {
        res = tmp;
        p = i;
        f = 1;
      }
    }
  }
  A = a[p] + (a[b] - a[c]);
  B = a[b] + (a[c] - a[p]);
  C = a[c] + (a[p] - a[b]);
  printf("%d %d\n", A.x, A.y);
  printf("%d %d\n", B.x, B.y);
  printf("%d %d\n", C.x, C.y);
  return 0;
}
