#include <fstream>
#include <vector>
#include <queue>
#define LMAX 50005

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector<int> G[LMAX];
int grad[LMAX];
int n, m;
int x, y;
queue<int> Q;
int act;

int main()
{
    fin>>n>>m;
    for (int i=1;i<=m;i++)
    {
        fin>>x>>y;
        grad[y]++;
        G[x].push_back(y);
    }
    for (int i=1;i<=n;i++)
        if (!grad[i])
           Q.push(i);
    while (!Q.empty())
    {
        act=Q.front();
        Q.pop();
        fout<<act<<' ';
        for (int i=0;i<G[act].size();i++)
            if (grad[G[act][i]])
                {
                 grad[G[act][i]]--;
                 if (!grad[G[act][i]])
                     Q.push(G[act][i]);
                }
    }
    fout<<'\n';
    fin.close();
    fout.close();
    return 0;
}