#include <fstream>
#include <vector>

using namespace std;

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

vector<int> V[50001];
bool used[50001];
int order[50001];
int k = 0;

void dfs(int nod)
{
    used[nod] = true;
    for(vector<int>::iterator it = V[nod].begin(); it != V[nod].end(); it++)
        if(!used[*it])
            dfs(*it);
    order[++k] = nod;
}

int main()
{
    int n,m,x,y;
    fin>>n>>m;
    for(int i = 1; i<= m;i ++)
    {
        fin>>x>>y;
        V[x].push_back(y);
    }
    for(int i = 1; i<= n; i++)
        if(!used[i])
            dfs(i);
    for(int i = n; i >= 1  ; i--)
        fout<<order[i]<<' ' ;

    return 0;
}