#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50001

using namespace std;

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

vector<int> V[NMAX];
queue<int> Q;
bool Viz[NMAX];

void afiseaza()
{
    int nod;
    if(!Q.empty())
    {
        nod = Q.front();
        Q.pop();
        afiseaza();
        out<<nod<<' ';
    }
}

void DFS(int nod)
{
    int i;
    Viz[nod]=1;
    for(i=0;i<V[nod].size();i++)
        if(!Viz[V[nod][i]])
            DFS(V[nod][i]);
    Q.push(nod);
}

int main()
{
    int N,M,x,y,i;
    in>>N>>M;
    while(M--)
    {
        in>>x>>y;
        V[x].push_back(y);
    }
    for(i=1;i<=N;i++)
        if(!Viz[i])
            DFS(i);
    afiseaza();
    return 0;
}