#include <cstdio>
#include <deque>
#include <vector>
using namespace std;
#define Max 50001

vector<int>v[Max];
deque<int>d;

int n;
bool was[Max];

void dfs(int x)
{
    int y;
    was[x] = 1;
    for(int i=0;i<v[x].size();i++)
    {
        y = v[x][i];
        if(was[y] == 0)dfs(y);
    }
    d.push_front(x);
}

int main()
{
    int m,x,y;
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
        scanf("%d %d",&n,&m);
        while(m--)
        {
            scanf("%d %d",&x,&y);
            v[x].push_back(y);
        }
    for(int i=1;i<=n;i++)
    if(was[i]==0)dfs(i);

    while(d.size())
    {
        printf("%d ",d.front());
        d.pop_front();
    }
    return 0;
}