#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ql = queue<ll>;
using sl = set<ll>;
using vl = vector<ll>;
using msl = multiset<ll>;
using Graph = vector<vector<ll>>;
using P = pair<ll, ll>;
template <typename T> inline bool chmax(T &a, T b) {
    return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
    return ((a > b) ? (a = b, true) : (false));
}
#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)
#define rep(i, n) for(ll i = 0; i < ((ll)n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
template <typename T> void print(T &d) {
    for(auto &i : d)
        cout << i << " ";
    if(d.size())
        cout << endl;
}
void solve() {
    vl a(3),b(3);
    rep(i,3)cin>>a[i];
    rep(i,3)cin>>b[i];
    vl c(3);
    c[0]=a[1]*b[2]-a[2]*b[1];
    c[1]=a[2]*b[0]-a[0]*b[2];
    c[2]=a[0]*b[1]-a[1]*b[0];
    print(c);
}

int main() {
    // { // 前処理　MAX=1e6
    //     rep1(i, MAX) fac[i] = i * fac[i - 1];
    //     ifac[MAX] = fac[MAX].inv();
    //     for(ll i = MAX; i >= 1; i--)
    //         ifac[i - 1] = ifac[i] * (i);
    // }
    ll t;
    t = 1;
    // cin >> t;
    rep(_, t) solve();
}