OI II - tro

// https://szkopul.edu.pl/problemset/problem/PSGZOmMCFc3M4K9M3cB-pDKy/site/?key=statement

#include <bits/stdc++.h>

using namespace std;

#define int long long

constexpr int sizik = 1000 * 1001;

#define ar std::array
#define pr std::pair
#define vec std::vector

typedef vec<vec<int>> _kra;

void solve() {
    std::vector<int> v;

    for (int i = 1; i <= 50; i++) {
        int a;
        std::cin >> a;

        if (a == 0) break;
        v.push_back(a);
    }

    std::sort(v.begin(), v.end());

    for (int i = 0; i < v.size() - 2; i++) {
        int a = v[i], b = v[i + 1], c = v[i + 2];

        if (a + b > c) {
            std::cout << a << " " << b << " " << c << '\n';
            return;
        }
    }

    std::cout << "NIE\n";
}

int32_t main() {
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);

    int t = 1;
    // std::cin >> t;

    for (; t > 0; t--) {
        solve();
    }

    return 0;
}