#include <fstream>
#include <queue>
#include <vector>
#define NMAX 50002
using namespace std;
ifstream  fin("sortaret.in");
ofstream fout("sortaret.out");
int N,M,grad_int[NMAX];
vector<int>graph[NMAX];
queue<int>q;

void citire()
{
    int x,y;
    fin>>N>>M;

    for(int i=1; i<=M; i++)
    {
        fin>>x>>y;
        grad_int[y]++;
        graph[x].push_back(y);
    }
}


int main()
{
    citire();

    for(int i=1; i<=N; i++)
    {
        if(!grad_int[i])
        {
            q.push(i);
        }
    }

    while(!q.empty())
    {
        int nod=q.front();
        q.pop();

        fout<< nod << " ";

        for(int i=0; i<graph[nod].size(); i++)
        {
            int next_nod=graph[nod][i];
            grad_int[next_nod]--;
            if(grad_int[next_nod]==0)
            {
                q.push(next_nod);
            }
        }
    }

    fout<< "\n";

    return 0;
}