#include <iostream>
#include <algorithm>
using namespace std;

bool BinarySearch(int v[], int st, int dr, int x) {
    int mij;
    if (dr >= 1) {
        mij = 1 + (dr -1)/2;
    }

    // conditia de oprire
    if (x == v[mij]) {
        return true;
    }

    if (x < v[mij]) {
        BinarySearch(v, mij - 1, dr, x);
    }

    if (x > v[mij]) {
        BinarySearch(v, st, mij + 1, x);
    }

    return false;
}

int main() {
    int v[100];
    int n; cin >> n;
    int s; cin >> s;

    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }

    // sortez crescator vectorul;
    sort(v, v + n - 1);

    for (int i = 0; i < n; ++i) {
        int x = v[i];
        bool p = BinarySearch(v, 0, n - 1, x);

        if (p) {
            cout << x << " " << s - x;
            break;
        }
    }
    return 0;
}