#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
const int NMAX = 100001;

int N,M;
vector<int> G[NMAX+1], L;
queue<int> Q;
int viz[NMAX+1];
ifstream f("sortaret.in");
ofstream g("sortaret.out");
void citire()
{
    int x,y;
    f>>N>>M;
    for(int i=1;i<=M;i++)
    {
        f>>x>>y;
        G[x].push_back(y);
    }
}
void DFS(int x)
{
    viz[x]=1;
    for(const int &y: G[x])
        if(viz[y]==0)
        DFS(y);
    L.push_back(x);
}


int main()
{
    int i;
    citire();
    for(int i=1;i<=N;i++)
        if(viz[i]==0)
        DFS(i);
    for(i=L.size()-1;i>=0;i--)
    g<<L[i]<<' ';

    return 0;
}