//  T =  02:00 , D = 2025/01/03
#include <bits/stdc++.h>
#define khaled_eg ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define ll long long
#define fr first
#define sc second
#define sz size()
#define cin(name) for (auto &e : name) cin>>e;
#define cout(name) for (auto &e : name) cout<<e<<" ";
#define all(name) name.begin() , name.end()
#define rall(name) name.rbegin() , name.rend()
#define cYES cout<<"YES\n";
#define cNO cout<<"NO\n";
#define popcnt(x) __builtin_popcount(x)
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
using namespace std;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//template <typename T, typename Compare = std::less<T>> using ordered_set = __gnu_pbds::tree<T, __gnu_pbds::null_type, Compare, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;
//order_of_key
//find_by_order

#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 50
#endif

const int dx[] = {1, -1, 0, 0, 1, -1, -1, 1};
const int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
const ll MOD = 1000000007;
int tt , tc ;
const ll N  = 2e5 + 5;



void solve()
{
	ll arr[3]; cin(arr);
	for (auto &e : arr) cout<<120-e<<' ';
}
#define testCases 0 //don't forget to edit to TRUE if needed

int main()
{					khaled_eg

	tt = 1 , tc = 1;
	if(testCases)
		cin>>tt;

	while (tt--){
        solve(),tc++;
        if (tt)
            cout<<'\n';
	}

return 0;
}