#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m;
    cin >> n >> m;
    vector<vector<int>> q(m,vector<int>(4));
    rep(i,m){
        rep(j,4) cin >> q[i][j];
        q[i][0]--;
        q[i][1]--;
    }
    vector<int> a = {1,2,3};
    do{
        bool ans = true;
        rep(i,m){
            if(a[q[i][0]]!=q[i][2] && a[q[i][1]]!=q[i][3]){
                ans = false;
                break;
            }
        }
        if(ans){
            rep(i,3) cout << a[i] << ' ';
            cout << '\n';
            return 0;
        }
    }while(next_permutation(all(a)));
    cout << -1 << '\n';
    return 0;
}