#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 1e5 + 3, MOD = 998244353;//1e9 + 7;

int32_t main() {

    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);

    vector<vector<ll> > a(2 , vector<ll> (3)) ;

    for (int i = 0; i < 2; ++i) {
        for (int j = 0; j < 3; ++j) {
            cin >> a[i][j] ;
        }
    }

    ll dis = abs(a[0][0] - a[1][0]) + abs( a[0][1] - a[1][1] ) ;

    if(dis > a[0][2] + a[1][2] || dis%2 != (a[0][2] + a[1][2])%2  ) return cout << "impossible" , 0 ;

    if(a[0][2] > a[1][2]) swap(a[1],  a[0]) ;

    dis = min( dis - ( dis%2 != a[0][2]%2 ) , a[0][2] ) ;

    ll x ;
    if(a[1][0] > a[0][0]) x = min( a[1][0] , a[0][0] + dis ) ;
    else x = max( a[1][0] , a[0][0] - dis ) ;

    dis -= abs(x - a[0][0]);

    if(a[1][1] > a[0][1]) cout << x << " " << min(a[1][1] , a[0][1] + dis) ;
    else cout << x << " " << max(a[1][1] , a[0][1] - dis) ;

    return 0;
}