#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

#define maxn 50100

int viz[maxn], gradInten[maxn];
vector<int> matrice[maxn];

int v[10], k, n;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

void read() {
    int  m;
    f >> n >> m;
    for( int i = 0; i < m; i++) {
        int a, b;
        f >> a >> b;
        matrice[a].push_back(b);
        gradInten[b]++;
    }
}

void solve() {
    int i;
    for( i = 1; i <= n; i++) {
        int j;
        for( j = 1; j <= n; j++) {
            if( !viz[j] and !gradInten[j] ) {
                g << j << " ";
                viz[j] = 1;
                int k;
                for( k = 0; k < matrice[j].size(); k++ )
                    gradInten[ matrice[j][k] ]--;
                break;
            }
        }
    }
}

int main() {
    read();
    solve();
    return 0;

}