#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int>A[50100];
stack <int> S;
int n,m;
int F[50100];
void parc(int x)
{
    F[x]=1;
    for (auto it:A[x])
    {
        if (F[it]==0)
            parc(it);
    }
    S.push(x);
}
int main()
{
    fin>>n>>m;
    for (int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        A[x].push_back(y);
    }
        for (int i=1;i<=n;i++)
        {
            if (F[i]==0)
                parc(i);
        }
    while (!S.empty())
    {
        fout<<S.top()<<' ';
        S.pop();
    }
    return 0;
}