#include <bits/stdc++.h>
using namespace std;
struct edge {
  long long to, cost;
  edge() {}
  edge(long long a, long long b) { to = a, cost = b; }
};
const long long dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const long long mod = 1000000007;
struct mint {
  long long x = 0;
  mint(long long y = 0) {
    x = y;
    if (x < 0 || x >= mod) x = (x % mod + mod) % mod;
  }
  mint(const mint& ope) { x = ope.x; }
  mint operator-() { return mint(-x); }
  mint operator+(const mint& ope) { return mint(x) += ope; }
  mint operator-(const mint& ope) { return mint(x) -= ope; }
  mint operator*(const mint& ope) { return mint(x) *= ope; }
  mint operator/(const mint& ope) { return mint(x) /= ope; }
  mint& operator+=(const mint& ope) {
    x += ope.x;
    if (x >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint& ope) {
    x += mod - ope.x;
    if (x >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint& ope) {
    x *= ope.x, x %= mod;
    return *this;
  }
  mint& operator/=(const mint& ope) {
    long long n = mod - 2;
    mint mul = ope;
    while (n) {
      if (n & 1) *this *= mul;
      mul *= mul;
      n >>= 1;
    }
    return *this;
  }
  mint inverse() { return mint(1) / *this; }
  bool operator==(const mint& ope) { return x == ope.x; }
  bool operator!=(const mint& ope) { return x != ope.x; }
};
mint modpow(mint a, long long n) {
  if (n == 0) return mint(1);
  if (n % 2)
    return a * modpow(a, n - 1);
  else
    return modpow(a * a, n / 2);
}
istream& operator>>(istream& is, mint& ope) {
  long long t;
  is >> t, ope.x = t;
  return is;
}
ostream& operator<<(ostream& os, mint& ope) { return os << ope.x; }
ostream& operator<<(ostream& os, const mint& ope) { return os << ope.x; }
bool exceed(long long x, long long y, long long m) { return x >= m / y + 1; }
void mark() { cout << "*" << endl; }
void yes() { cout << "YES" << endl; }
void no() { cout << "NO" << endl; }
long long sgn(long long x) {
  if (x > 0) return 1;
  if (x < 0) return -1;
  return 0;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long digitnum(long long x, long long b = 10) {
  long long ret = 0;
  for (; x; x /= b) ret++;
  return ret;
}
long long digitsum(long long x, long long b = 10) {
  long long ret = 0;
  for (; x; x /= b) ret += x % b;
  return ret;
}
string lltos(long long x) {
  string ret;
  for (; x; x /= 10) ret += x % 10 + '0';
  reverse(ret.begin(), ret.end());
  return ret;
}
long long stoll(string& s) {
  long long ret = 0;
  for (auto c : s) ret *= 10, ret += c - '0';
  return ret;
}
template <typename T>
void uniq(T& vec) {
  sort(vec.begin(), vec.end());
  vec.erase(unique(vec.begin(), vec.end()), vec.end());
}
template <typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
  for (int i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, deque<T>& deq) {
  for (int i = 0; i < deq.size(); i++)
    os << deq[i] << (i + 1 == deq.size() ? "" : " ");
  return os;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, pair<T, U>& pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, map<T, U>& map_var) {
  for (typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end();
       itr++) {
    os << "(" << itr->first << ", " << itr->second << ")";
    itr++;
    if (itr != map_var.end()) os << ",";
    itr--;
  }
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, set<T>& set_var) {
  for (typename set<T>::iterator itr = set_var.begin(); itr != set_var.end();
       itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, multiset<T>& set_var) {
  for (typename multiset<T>::iterator itr = set_var.begin();
       itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}
template <typename T>
void outa(T a[], long long s, long long t) {
  for (long long i = s; i <= t; i++) {
    cout << a[i];
    if (i < t) cout << " ";
  }
  cout << endl;
}
void dump_func() { cout << endl; }
template <class Head, class... Tail>
void dump_func(Head&& head, Tail&&... tail) {
  cout << head;
  if (sizeof...(Tail) > 0) cout << " ";
  dump_func(std::move(tail)...);
}
struct vec2d {
  long long x, y;
  vec2d() {}
  vec2d(long long x, long long y) { this->x = x, this->y = y; }
  long long add(long long a, long long b) { return a + b; }
  vec2d operator+(vec2d ope) { return vec2d(add(x, ope.x), add(y, ope.y)); }
  vec2d operator-(vec2d ope) { return vec2d(add(x, -ope.x), add(y, -ope.y)); }
  vec2d operator*(double t) { return vec2d(x * t, y * t); }
  vec2d operator/(double t) { return vec2d(x / t, y / t); }
  long long dot(vec2d ope) { return add(x * ope.x, y * ope.y); }
  long long cross(vec2d ope) { return add(x * ope.y, -y * ope.x); }
};
bool compare(vec2d u, vec2d v) {
  if (u.x < v.x) return true;
  if (u.x > v.x) return false;
  return u.y < v.y;
}
void ConvexHull(vector<vec2d>& src, vector<vec2d>& dest) {
  sort(src.begin(), src.end(), compare);
  dest.clear();
  dest.resize(2 * src.size());
  int k = -1;
  for (int i = 0; i < src.size(); i++) {
    while (k >= 1 && (src[i] - dest[k]).cross(dest[k] - dest[k - 1]) >= 0) k--;
    dest[k + 1] = src[i];
    k++;
  }
  for (int i = (int)src.size() - 2, t = k; i >= 0; i--) {
    while (k > t && (src[i] - dest[k]).cross(dest[k] - dest[k - 1]) >= 0) k--;
    dest[k + 1] = src[i];
    k++;
  }
  dest.resize(k + 1);
}
long long n, S;
vec2d p[5005];
vector<vec2d> vec, cvec;
long long get(vec2d a, vec2d b, vec2d c) { return abs((b - a).cross(c - a)); }
int main(void) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> S;
  long long x, y;
  for (long long(i) = (1); (i) <= (n); (i)++) {
    cin >> x >> y;
    vec.push_back(vec2d(x, y));
  }
  ConvexHull(vec, cvec);
  cvec.pop_back();
  n = ((long long)(cvec).size());
  long long mx = 0, a, b, c;
  for (long long(i) = (0); (i) <= (n - 3); (i)++) {
    long long k = (i + 2) % n;
    for (long long(j) = (i + 1); (j) <= (n - 2); (j)++) {
      while (1) {
        long long nk = (k + 1) % n;
        if (get(cvec[i], cvec[j], cvec[k]) >= get(cvec[i], cvec[j], cvec[nk]))
          break;
        k = nk;
      }
      long long res = get(cvec[i], cvec[j], cvec[k]);
      if (mx < res) {
        mx = res;
        a = i, b = j, c = k;
      }
    }
  }
  vec2d ans[3];
  ans[0] = cvec[c] + cvec[b] - cvec[a];
  ans[1] = cvec[a] + cvec[c] - cvec[b];
  ans[2] = cvec[b] + cvec[a] - cvec[c];
  for (long long(i) = (0); (i) <= (2); (i)++)
    cout << ans[i].x << " " << ans[i].y << endl;
  return 0;
}
