#include <bits/stdc++.h>
using namespace std;
const int N = 11111;
pair<int, int> p[N], convex[N];
__inline pair<int, int> operator+(const pair<int, int>& a,
                                  const pair<int, int>& b) {
  return make_pair(a.first + b.first, a.second + b.second);
}
__inline pair<int, int> operator-(const pair<int, int>& a,
                                  const pair<int, int>& b) {
  return make_pair(a.first - b.first, a.second - b.second);
}
__inline long long dot(const pair<int, int>& a, const pair<int, int>& b) {
  return 1LL * a.first * b.first + 1LL * a.second * b.second;
}
__inline long long det(const pair<int, int>& a, const pair<int, int>& b) {
  return 1LL * a.first * b.second - 1LL * a.second * b.first;
}
pair<int, int>* make_convex(pair<int, int>* c0, pair<int, int>* p, int n) {
  pair<int, int>* c = c0;
  for (int i = 0; i < n; i++) {
    for (; c > c0 + 1 && det(p[i] - *(c - 1), *(c - 1) - *(c - 2)) >= 0; c--)
      ;
    *c++ = p[i];
  }
  return c;
}
__inline long long calc_S(const pair<int, int>& a, const pair<int, int>& b,
                          const pair<int, int>& c) {
  return abs(det(b - a, c - a));
}
__inline void print(const pair<int, int>& p) {
  printf("%d %d\n", p.first, p.second);
}
int main() {
  int n;
  long long S;
  cin >> n >> S;
  for (int i = 0; i < n; i++) cin >> p[i].first >> p[i].second;
  sort(p, p + n);
  pair<int, int>* t = make_convex(convex, p, n);
  reverse(p, p + n);
  n = make_convex(t, p, n) - convex;
  n = unique(convex, convex + n) - convex;
  memcpy(convex + n, convex, sizeof(convex[0]) * n);
  long long maxS = 0;
  pair<int, int> a, b, c;
  for (int i = 0; i < n; i++) {
    long long curS = 0;
    for (int j = i + 1, k = j; k < n + i; j++) {
      curS = calc_S(convex[i], convex[j], convex[k]);
      for (; k == j ||
             k < n + i && calc_S(convex[i], convex[j], convex[k + 1]) >= curS;)
        curS = calc_S(convex[i], convex[j], convex[++k]);
      if (curS > maxS) {
        maxS = curS;
        a = convex[i];
        b = convex[j];
        c = convex[k];
      }
    }
  }
  pair<int, int> C = a + (b - c), B = a + (c - b), A = b + (c - a);
  print(A);
  print(B);
  print(C);
  return 0;
}
