#include <fstream>
#include <vector>
using namespace std;
ofstream fout("sortaret.out");
ifstream fin("sortaret.in");

vector <int> v[50010];

int x,y,sol[50010],viz[50010],k,n,m;

void dfs(int nod)
{
    viz[nod] = 1;

    for(int i = 0; i < v[nod].size(); i++)
    {
        if(viz[v[nod][i]] == 0)
        {
            dfs(v[nod][i]);
        }
    }

    sol[++k] = nod;
}

int main()
{
    fin >> n >> m;

    for(int i = 1; i <= m; i++){
        fin >> x >> y;
        v[y].push_back(x);
    }

    for(int i = 1; i <= n; i++){
        if(viz[i] == 0)
        {
            dfs(i);
        }
    }

    for(int i = 1; i <= n; i++)
    {
        fout << sol[i] << ' ';
    }

    return 0;
}