#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 5000 + 10;
long long x[MAX_N];
long long y[MAX_N];
int n;
long long s;
int a, b, c;
long long ar(int a, int b, int c) {
  return abs((x[b] - x[a]) * (y[c] - y[a]) - (y[b] - y[a]) * (x[c] - x[a]));
}
void finds() {
  a = 1;
  b = 2;
  c = 3;
  int flag = 0;
  while (1) {
    flag = 0;
    for (int i = 1; i <= n; i++) {
      if (ar(i, b, c) > ar(a, b, c)) a = i, flag = 1;
      if (ar(a, i, c) > ar(a, b, c)) b = i, flag = 1;
      if (ar(a, b, i) > ar(a, b, c)) c = i, flag = 1;
    }
    if (flag == 0) break;
  }
}
int main() {
  while (scanf("%d%I64d", &n, &s) != EOF) {
    for (int i = 1; i <= n; i++) {
      cin >> x[i] >> y[i];
    }
    finds();
    cout << x[c] - x[a] + x[b] << " " << y[b] - y[a] + y[c] << endl;
    cout << x[a] - x[c] + x[b] << " " << y[b] - y[c] + y[a] << endl;
    cout << x[c] - x[b] + x[a] << " " << y[c] - y[b] + y[a] << endl;
  }
  return 0;
}
