#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

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

#define MAXVALUE 50010

///adiacenta
vector<vector<int>>matAdic(MAXVALUE);
///noduri vizitate
vector<int>viz(MAXVALUE);
vector<int>nod;

void dfs(int n)
{
    viz[n] = 1;
    for(int i = 0; i < matAdic[n].size(); i++)
        if(viz[matAdic[n][i]] == 0)
            dfs(matAdic[n][i]);
    nod.push_back(n);
}

int main()
{
    int noduri, edges;
    fin>>noduri>>edges;

    int a, b;
    for(int i = 0; i < edges; i++)
    {
        fin>>a>>b;
        matAdic[a].push_back(b);
    }

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

    for(int i = nod.size() - 1; i>=0; i--)
        fout<<nod[i]<<" ";
}