#include <bits/stdc++.h>
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int nmax=50005;
vector <int> a[nmax];
stack <int> steve;
int viz[nmax];
int x,y,n,m;

void dfs(int nod)
{
   viz[nod]=1;
   int vecini;
   vecini=a[nod].size();
   for (int i=0;i<vecini;i++)
        if (viz[a[nod][i]]==0)
         dfs(a[nod][i]);
   steve.push(nod);
}

int main()
{
    f>>n>>m;
    int i;
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
    }

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

    while (!steve.empty())
    {
        g<<steve.top()<<" ";
        steve.pop();
    }

    return 0;
}