#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int N=50001;
vector <int> a[N];
vector <unsigned> sol;
unsigned srt[N],n,m,nr;
bool p[N],viz[N];
void dfs(int x)
{
    int y;
    viz[x]=true;
    for(unsigned i=0;i<a[x].size();i++)
    {
        y=a[x][i];
        if(!viz[y])
            dfs(y);
    }
    srt[++nr]=x;
}
int main()
{
    unsigned i;
    int x,y;
    in>>n>>m;
    for(i=0;i<m;i++)
    {
        in>>x>>y;
        a[x].push_back(y);
        p[y]=true;
    }
    for(i=1;i<=n;i++)
        if(!p[i])
        {
            dfs(i);
            break;
        }
    for(i=n;i>0;i--)
        out<<srt[i]<<' ';
    return 0;
}