#include <bits/stdc++.h>
using namespace std;

int main() {
    int m, n; cin >> m >> n;
    int ins[m];
    vector<int> outs[m];
    for (int i=0; i<m; i++) ins[i] = 0;
    
    for (int i=0; i<n; i++) {
        int xi, yi; cin >> xi >> yi;
        ins[yi-1]++;
        outs[xi-1].push_back(yi-1);
    }
    
    queue<int> q;
    vector<int> ans;
    
    for (int i=0; i<m; i++) {
        if (ins[i]==0) q.push(i);
    }
    
    while (q.size()) {
        int v = q.front(); q.pop();
        ans.push_back(v);
        
        for (auto nv : outs[v]) {
            ins[nv]--;
            if (ins[nv]==0) q.push(nv);
        }
    }
    
    for (int i=0; i<m; i++) {
        if (ans[i]==1) continue;
        cout << ans[i]+1 << endl;
    }
    
    cout << 2 << endl;
}
