#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <bitset>
#include <algorithm>

#define nmax 50000
using namespace std;
vector<int> g[nmax];
bitset<nmax> viz;
stack<int> s;
int n,m;

void read()
{
    scanf("%d %d",&n,&m);
    int x,y;
    for(int i=1;i<=m;++i)
    {
        scanf("%d %d",&x,&y);
        g[x].push_back(y);
    }
}

void dfs(int x)
{
    for(int i=0;i<g[x].size();i++)
        if(viz[g[x][i]]==0)
            dfs(g[x][i]);
    s.push(x);
    viz[x]=1;
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    read();
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
            dfs(i);
    while(!s.empty())
        {printf("%d ",s.top());
        s.pop();}
    return 0;
}