#include <bits/stdc++.h>
using namespace std;
long long n, s, x[5678], y[5678];
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]));
}
int main() {
  scanf("%lld %lld", &n, &s);
  for (int i = (0); i < (n); i++) scanf("%lld %lld", x + i, y + i);
  int a = 0, b = 1, c = 2;
  while (1) {
    char g = 1;
    for (int i = (0); i < (n); i++) {
      if (ar(i, b, c) > ar(a, b, c)) a = i, g = 0;
      if (ar(a, i, c) > ar(a, b, c)) b = i, g = 0;
      if (ar(a, b, i) > ar(a, b, c)) c = i, g = 0;
    }
    if (g) break;
  }
  printf("%lld %lld\n%lld %lld\n%lld %lld\n", x[a] + x[b] - x[c],
         y[a] + y[b] - y[c], x[b] + x[c] - x[a], y[b] + y[c] - y[a],
         x[c] + x[a] - x[b], y[c] + y[a] - y[b]);
  return 0;
}
