#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
long long x[N], y[N];
long long area2(int i, int j, int s) {
  return abs((x[i] - x[s]) * (y[j] - y[s]) - (y[i] - y[s]) * (x[j] - x[s]));
}
long long gx(int i, int j, int s) { return x[i] + x[j] - x[s]; }
long long gy(int i, int j, int s) { return y[i] + y[j] - y[s]; }
void solve() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, s;
  cin >> n >> s;
  for (int i = 0; i < n; ++i) {
    cin >> x[i] >> y[i];
  }
  int f1 = 0, f2 = 1, f3 = 2, up = 1;
  while (up) {
    up = 0;
    for (int i = 0; i < n; ++i) {
      if (area2(f1, f2, i) > area2(f1, f2, f3)) {
        f3 = i;
        up = 1;
      } else if (area2(f1, i, f3) > area2(f1, f2, f3)) {
        f2 = i;
        up = 1;
      } else if (area2(i, f2, f3) > area2(f1, f2, f3)) {
        f1 = i;
        up = 1;
      }
    }
  }
  cout << gx(f1, f2, f3) << " " << gy(f1, f2, f3) << endl;
  cout << gx(f1, f3, f2) << " " << gy(f1, f3, f2) << endl;
  cout << gx(f2, f3, f1) << " " << gy(f2, f3, f1) << endl;
}
int main() {
  solve();
  return 0;
}
