#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define fi first
#define se second
#define pp push_back
#define all(x) (x).begin(), (x).end()
#define Ones(n) __builtin_popcount(n)
#define endl '\n'
#define mem(arrr, xx) memset(arrr,xx,sizeof arrr)
//#define int long long
#define debug(x) cout << (#x) << " = " << x << endl

void Gamal() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

int dx[] = {+0, +0, -1, +1, +1, +1, -1, -1};
int dy[] = {-1, +1, +0, +0, +1, -1, +1, -1};

const double EPS = 1e-9;
const ll OO = 0X3F3F3F3F3F3F3F3F;
const int N = 2e5 + 5, INF = INT_MAX, MOD = 1e9 + 7, LOG = 20;


void solve() {
    ll x1, y1, d1;
    cin >> x1 >> y1 >> d1;
    ll x2, y2, d2;
    cin >> x2 >> y2 >> d2;
    ll dist = abs(x1 - x2) + abs(y1 - y2);
    if (dist > d1 + d2) {
        cout << "impossible";
        return;
    }
    ll go = min(abs(x2-x1),d1);
    x1 += go * (x1 < x2 ? 1:-1);
    d1 -= go;

    go = min(abs(y2-y1),d1);
    y1 += go * (y1 < y2 ? 1:-1);
    d1 -= go;


    go = min(abs(x2-x1),d2);
    x2 += go * (x2 < x1 ? 1:-1);
    d2 -= go;

    go = min(abs(y2-y1),d2);
    y2 += go * (y2 < y1 ? 1:-1);
    d2 -= go;

    if(d1 & 1 || d2 & 1){
        cout << "impossible";
        return;
    }
    assert(x1 == x2 && y1 == y2);
    cout << x1 << ' ' << y1;




}


signed main() {
    Gamal();
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}