#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
struct Point {
  long long x, y;
} point[10010];
long long area(int i, int j, int k) {
  return abs((point[j].x - point[i].x) * (point[k].y - point[i].y) -
             (point[j].y - point[i].y) * (point[k].x - point[i].x));
}
int r1, r2, r3;
void found(int n) {
  int a = 1, b = 2, c = 3;
  for (;;) {
    bool judge = true;
    for (int i = 1; i <= n; ++i) {
      if (area(a, b, c) < area(a, i, c)) {
        b = i;
        judge = 0;
      }
      if (area(a, b, c) < area(i, b, c)) {
        a = i;
        judge = 0;
      }
      if (area(a, b, c) < area(a, b, i)) {
        c = i;
        judge = 0;
      }
    }
    if (judge) break;
  }
  r1 = a, r2 = b, r3 = c;
}
int main() {
  int n;
  long long s;
  cin >> n >> s;
  for (int i = 1; i <= n; ++i) scanf("%lld%lld", &point[i].x, &point[i].y);
  found(n);
  cout << point[r1].x + point[r2].x - point[r3].x << " "
       << point[r1].y + point[r2].y - point[r3].y << endl;
  cout << point[r2].x + point[r3].x - point[r1].x << " "
       << point[r3].y + point[r2].y - point[r1].y << endl;
  cout << point[r1].x + point[r3].x - point[r2].x << " "
       << point[r1].y + point[r3].y - point[r2].y << endl;
}
