#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define NMAX 50000
#define MMAX 100000

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

int N,M;

vector<int> Grad(NMAX,0);
vector<vector<int>>G(NMAX);

void citire()
{
    f>>N;
    f>>M;

    for(int i=0;i<M;i++)
    {
        int a,b;
        f>>a>>b;
        Grad[b]++;
        G[a].push_back(b);
    }
}


void sortaretop()
{
    queue<int> q;
    for(int i=1;i<=N;i++)
        if(Grad[i]==0)
        q.push(i);


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

        for(auto n:G[nod])
        {
            Grad[n]--;
            if(Grad[n]==0)
                q.push(n);
        }
    }
}

int main()
{
  citire();
  sortaretop();

    return 0;
}