#include<iostream>
#include<fstream>
#include<queue>
#include<vector>
using namespace std;
const int NMAX=50000;

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

int n,m;
vector<int>g[NMAX+1],l;
queue<int>q;
int gr[NMAX+1];

void citire()
{
    int x,y;
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
        gr[y]++;
    }
}

void sortare()
{
    for(int i=1; i<=n; i++)
        if(gr[i]==0)
            q.push(i);

    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        l.push_back(x);
        for(const auto &y:g[x])
        {
            gr[y]--;
            if(gr[y]==0)
                q.push(y);
        }
    }

}

int main()
{
    citire();
    sortare();
    for(const auto &x:l)
        fout<<x<<" ";

    fin.close();
    fout.close();
    return 0;
}