#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
cerr<<vars<<" = ";
string delim="";
(...,(cerr<<delim<<values,delim=", "));
cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif
#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mxN=3e3+5; //make sure this is right
const int mod=1e9+7;
int good[mxN][mxN];
int main(){
cin.sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifdef LOCAL
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
vector<vector<int>> has;
int n,m; cin>>n>>m;
for(int i=0;i<m;i++){
int a,b; cin>>a>>b;
good[a][b]=good[b][a]=1;
}
for(int i=1;i<=n;i++){
int found=0;
for(auto &u:has){
int bad=0;
for(int &j:u){
if(!good[i][j]) bad=1;
}
if(bad) continue;
found=1;
u.pb(i);
break;
}
if(!found) has.pb({i});
}
for(auto &u:has){
if(sz(u)>=n/3){
for(int i=0;i<n/3;i++){
cout<<u[i]<<" ";
}
return 0;
}
}
assert(false);
}
