#include <fstream>
#include <vector>
#include <queue>
#define nmax 50002
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector <int> graf[nmax];
int grad[nmax];
queue <int> coada;

int main()
{
    int n,m,x,y;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        graf[x].push_back(y);
        grad[y]++;
    }
    for(int i=1;i<=n;i++)
        if(grad[i]==0)
            coada.push(i);
    while(!coada.empty())
    {
        int nod=coada.front();
        fout<<nod<<" ";
        int lg=graf[nod].size();
        coada.pop();
        for(int i=0;i<lg;i++)
        {
            grad[graf[nod][i]]--;
            if(grad[graf[nod][i]]==0)
                coada.push(graf[nod][i]);
        }
    }
    return 0;
}