#include <bits/stdc++.h>
using namespace std;
long long n, s, x[5010], y[5010], i, j, a, b, c, f, ss;
long long mianji(long long i, long long j, long long k) {
  long long x1 = x[k] - x[i], y1 = y[k] - y[i], x2 = x[k] - x[j],
            y2 = y[k] - y[j];
  return abs(x1 * y2 - x2 * y1);
}
int main() {
  while (scanf("%lld %lld", &n, &s) != EOF) {
    for (i = 1; i <= n; i++) scanf("%lld %lld", &x[i], &y[i]);
    f = 1;
    a = 1, b = 2, b = 3;
    ss = mianji(a, b, c);
    while (f) {
      f = 0;
      for (i = 1; i <= n; i++) {
        if (ss < mianji(i, b, c)) {
          ss = mianji(i, b, c);
          a = i;
          f = 1;
        }
        if (ss < mianji(a, i, c)) {
          ss = mianji(a, i, c);
          b = i;
          f = 1;
        }
        if (ss < mianji(a, b, i)) {
          ss = mianji(a, b, i);
          c = i;
          f = 1;
        }
      }
    }
    printf("%lld %lld\n", x[a] + x[b] - x[c], y[a] + y[b] - y[c]);
    printf("%lld %lld\n", x[a] + x[c] - x[b], y[a] + y[c] - y[b]);
    printf("%lld %lld\n", x[c] + x[b] - x[a], y[c] + y[b] - y[a]);
  }
}
