#include <fstream>
#include <vector>

using namespace std;

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

vector < vector <int> > G;
vector <int> viz;
int N,M;

void DFS(int nod)
{
    viz[nod]=1;
    int n=G[nod].size();
    for(int i=0;i<n;i++)
    {
        int aux=G[nod][i];
        if(viz[aux]==0)
            DFS(aux);
    }
    fout<<nod<<" ";
}

int main()
{
    fin>>N>>M;
    G.resize(N+1);
    viz.resize(N+1,0);
    int i;
    for(i=1;i<=M;i++)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
    }
    for(i=1;i<=N;i++)
    {
        if(viz[i]==0)
        {
            DFS(i);
        }
    }
    return 0;
}