#include <bits/stdc++.h>
const int maxn = 5e3 + 5;
using namespace std;
long long x[maxn], y[maxn];
long long s, xx, yy;
int n;
long long ar(int a, int b, int c) {
  return x[a] * y[b] + x[b] * y[c] + x[c] * y[a] - x[a] * y[c] - x[b] * y[a] -
         x[c] * y[b];
}
int main() {
  cin >> n >> s;
  for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
  int a = 1, b = 2, c = 3;
  while (1) {
    bool flag = 1;
    for (int i = 1; i <= n; i++) {
      if (ar(a, b, i) > ar(a, b, c)) {
        c = i;
        flag = 0;
      }
      if (ar(a, i, c) > ar(a, b, c)) {
        b = i;
        flag = 0;
      }
      if (ar(i, b, c) > ar(a, b, c)) {
        a = i;
        flag = 0;
      }
    }
    if (flag) break;
  }
  cout << -x[a] + x[b] + x[c] << " " << -y[a] + y[b] + y[c] << endl;
  cout << x[a] - x[b] + x[c] << " " << y[a] - y[b] + y[c] << endl;
  cout << x[a] + x[b] - x[c] << " " << y[a] + y[b] - y[c] << endl;
  return 0;
}
