#include <bits/stdc++.h>
using namespace std;
const int NMAX = 50005;
vector<int>mins[NMAX];
vector<int>mint[NMAX];
vector<int>sol;
queue<int>q;
int gri[NMAX];
int m , n;

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int x,y;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        mins[x].push_back(y);
        mint[y].push_back(x);
        gri[x]++;
    }
    for(int i=1;i<=n;i++)
        if(gri[i]==0)
            q.push(i);
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        sol.push_back(nod);
        for(int i=0;i<mint[nod].size();i++)
        {
            gri[mint[nod][i]]--;
            if(gri[mint[nod][i]]==0)
                q.push(mint[nod][i]);
        }
    }
    reverse(sol.begin(),sol.end());
    for(int i=0;i<sol.size();i++)
        printf("%d ",sol[i]);
    return 0;
}