#define Dudica "Dudescu Alexandru"
#include <cstdio>
#include <stack>
#include <vector>
#define nmax 50005
using namespace std;
FILE *f1=fopen("sortaret.in","r"),*f2=fopen("sortaret.out","w");
vector <int> g[nmax];
stack <int> st;
int m,n;
bool use[nmax];
void citire()
{
    fscanf(f1,"%d %d",&n,&m);
    int i,x,y;
    for(i=1;i<=m;i++)
    {
        fscanf(f1,"%d %d",&x,&y);
        g[x].push_back(y);
    }
}
void dfs(int x)
{
    int i;
    use[x]=1;
    for(i=0;i<g[x].size();i++)
        if(!use[g[x][i]])
            dfs(g[x][i]);
    st.push(x);
}
void afis()
{
    while(!st.empty())
    {
        fprintf(f2,"%d ",st.top());
        st.pop();
    }
}
int main()
{
    int i;
    citire();
    for(i=1;i<=n;i++)
    if(!use[i])
    dfs(i);
    afis();
    fclose(f1);
    fclose(f2);
    return 0;
}

//Our greatest weakness lies in giving up. The most certain way to succeed is always to try just one more time.