#include <bits/stdc++.h>
#define PI 2*asin(1)
#define ll long long
#define FOR(i, n) for(long long i = 0; i < n;i++)
using namespace std;
int main() {
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    ll s; cin >> s;
    ll na; cin >> na;
    vector<ll> A(na); FOR(i,na) cin >> A[i];
    ll nb; cin >> nb;
    vector<ll> B(nb); FOR(i,nb) cin >> B[i];
    ll nc; cin >> nc;
    vector<ll> C(nc); FOR(i,nc) cin >> C[i];
    vector<pair<int,int>> qwe(s+3);
    vector<bool>qwe2(s+3);
    FOR(i,s + 3)
        qwe2[i] = false;
    for(int i = 0; i < nb;i++){
        for(int j = 0; j < nc; j++){
            if(s - B[i] - C[j] > 0 && qwe2[s - B[i] - C[j]] == false){
                qwe[s - B[i] - C[j]].first = i;
                qwe[s - B[i] - C[j]].second = j;
                qwe2[s - B[i] - C[j]] = true;
            }
        }
    }
    for(int i = 0; i < na; i++){
        if(A[i] < s && qwe2[A[i]] == true){
            cout << i << ' ' << qwe[A[i]].first << ' ' << qwe[A[i]].second;
            return 0;
        }
    }
    cout << -1;
}