/*
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <vector <int> > a;
bool viz[50001];
int n, m;
void df(int k) {
    stack <int> queue;
    queue.push(k);
    viz[k] = true;
    for ()
}
void afis() {
    for (int i = 1; i <= n; i++) {
        fout<<i<<' ';
        for (int j = 0; j < a[i].size(); j++) {
            fout<<a[i][j]<<' ';
        }
        fout<<'\n';
    }
}
int checkNod() {
    for (int i = 1; i <= n; i++) {
        if (viz[i] == false) {
            return i;
        }
    }
    return 0;
}

int main()
{
    fin>>n>>m;
    int x, y;
    a.resize(n + 1);
    for (int i = 1; i <= m; i++) {
        fin>>x>>y;
        a[x].push_back(y);
    }
    int k = checkNod();
    while (k) {
        df(k);
        k = checkNod();
    }
    fin.close();
    fout.close();
    return 0;
}
*/
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <vector <int> > a;
bool viz[50001];
int n, m;
void df(int k) {
    viz[k] = true;
    for (int i = 0; i < a[k].size(); i++) {
        if(viz[a[k][i]] == false)
            df(a[k][i]);
    }
    fout<<k<<' ';
}
void afis() {
    for (int i = 1; i <= n; i++) {
        fout<<i<<' ';
        for (int j = 0; j < a[i].size(); j++) {
            fout<<a[i][j]<<' ';
        }
        fout<<'\n';
    }
}
int checkNod() {
    for (int i = 1; i <= n; i++) {
        if (viz[i] == false) {
            return i;
        }
    }
    return 0;
}

int main()
{
    fin>>n>>m;
    int x, y;
    a.resize(n + 1);
    for (int i = 1; i <= m; i++) {
        fin>>x>>y;
        a[y].push_back(x);
    }
    int k = checkNod();
    while (k) {
        df(k);
        k = checkNod();
    }
    fin.close();
    fout.close();
    return 0;
}