#include <fstream>
#include <string.h>
#include <vector>
#include <queue>
#include <limits.h>

#define nMax 50001
#define pb push_back
#define INF INT_MAX
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m;
int GIn[nMax];
vector<int> G[nMax];
queue<int> Q;
void read()
{
    int a, b;
    fin>>n>>m;

    for(int i=1;i<=m;i++)
    {
        fin>>a>>b;
        G[a].pb(b);
        GIn[b]++;
    }
}
void solve()
{
    for(int i=1;i<=n;i++)
        if(GIn[i]==0)
            Q.push(i);

    while(!Q.empty())
    {
        int node=Q.front();
        Q.pop();

        for(vector<int>::iterator it=G[node].begin();it!=G[node].end();it++)
        {
            int fiu=*it;
            GIn[fiu]--;

            if(GIn[fiu]==0)
                Q.push(fiu);
        }
        fout<<node<<" ";
    }

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