#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
const int NMAX=50005;
queue <int> q;
int pred[NMAX],sol[NMAX];
vector <int> succ[NMAX];
int main()
{
    freopen ("sortaret.in","r",stdin);
    freopen ("sortaret.out","w",stdout);
    int n,r,i,x,y,k=0;
    scanf ("%d%d",&n,&r);
    for (i=1;i<=r;i++)
    {
        scanf ("%d%d",&x,&y);
        pred[y]++;
        succ[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        if (pred[i]==0)
            q.push(i);
    while(!q.empty())
    {
        x=q.front();
        for (i=0;i<succ[x].size();i++)
        {
             pred[succ[x][i]]--;
             if(!pred[succ[x][i]])
                q.push(succ[x][i]);
        }
        sol[++k]=x;
        q.pop();
    }
    for(i=1;i<=k;i++)
        printf("%d " ,sol[i]);
    return 0;
}