#include <iostream>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;

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

const int n = 100001;

vector <int> v[n];
queue <int> q ;

int i,j,x,y,M,dist[n],N,s;

void citire(){

    f>>N>>M;
    for (i=1;i<=M ;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
        dist[y]++;
    }
}

void bfs()
{
    int x, y;
    for (int i=1;i<=N;i++)
    {
        if(dist [i]==0)
        {
            q.push(i);
        }
    }
    while(!q.empty())
    {
        x=q.front();
        g<<x<<" ";
        q.pop();
        for(size_t i=0;i<v[x].size();i++)
        {
            y=v[x][i];
            dist[y]--;
            if(dist[y]==0)
            {
                if(dist[y]==0)
                    q.push(y);
            }
        }
    }
}

int main()
{
    citire();
    bfs();
    return 0;
}