#include <cstdio>
#include <vector>
#define NMAX 50001

using namespace std;

FILE *fin=freopen("sortaret.in","r",stdin);
FILE *fout=freopen("sortaret.out","w",stdout);

vector <int> G[NMAX];
vector <int> L;

int n;
int viz[NMAX];

void citire()
{
    int m;
    int x;
    int y;
    scanf("%d %d\n",&n,&m);
    while (m--)
    {
        scanf("%d %d\n",&x,&y);
        G[x].push_back(y);
    }
}

void dfs(int i)
{
    for (int k=0;k<G[i].size();k++)
    {
        int v = G[i][k];
        if (viz[v]==0)
        {
            viz[v]=1;
            dfs(v);
        }
    }
    L.push_back(i);
}

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

void afisare()
{
    while (!L.empty())
    {
        printf("%d ",L.back());
        L.pop_back();
    }
}

int main()
{
    citire();
    solve();
    afisare();
    return 0;
}