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

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

vector<int> Ad[50009];
stack<int> S;

int n,m;
bool viz[50009];

void SortTop(int nod)
{
    viz[nod] = 1;
    for(int i = 0; i<Ad[nod].size(); ++i)
    {
        int w = Ad[nod][i];
        if(!viz[w])
        {
            SortTop(w);
        }
    }
    S.push(nod);
}

void Read()
{
    int x,y;
    fin>>n>>m;
    for(int i = 1; i<=m; ++i)
    {
        fin>>x>>y;
        Ad[x].push_back(y);
    }
    for(int i=1; i<=n; ++i)
        if(!viz[i])
            SortTop(i);
    while(!S.empty())
    {
        fout<<S.top()<<" ";
        S.pop();
    }
}

int main()
{
    Read();
    return 0;
}