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

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

const int MAX=50003;

vector <int> la[MAX];
deque <int> q;
int n,m,tata[MAX],viz[MAX];

void citire()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        tata[y]=x;
        la[x].push_back(y);
    }
}

void dfs(int nod)
{
    viz[nod]=1;
    for(unsigned i=0;i<la[nod].size();i++)
        if(!viz[la[nod][i]])
            dfs(la[nod][i]);
    q.push_front(nod);
}

int main()
{
    citire();
    for(int i=1;i<=n;i++)
        if(tata[i]==0)
            dfs(i);
    while(!q.empty())
    {
        fout<<q.front()<<' ';
        q.pop_front();
    }
}