#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector<int> graph[500005];
queue<int> q;
int grade[500005];
int n, m;

void citire()
{
    int x, y;
    f>>n>>m;
    for(int i=0; i<m; i++)
    {
      f>>x>>y;
      grade[y]++;
      graph[x].push_back(y);
    }
}

void bfs()
{
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(auto &v : graph[nod])
        {
            grade[v]--;
            if(grade[v]==0)
              q.push(v);
        }
        g<<nod<<" ";
    }
}

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

int main()
{
    citire();
    aflareGradIntern0();
    bfs();

    return 0;
}