#include <cstdio>
#include <queue>
#include <vector>

using namespace std;

int n,m;

vector <int> grade;
vector < vector <int> > g;
queue <int> q;

void read()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);

    scanf("%d%d",&n,&m);

    g.resize(n + 1, vector <int>(n + 1));
    grade.resize(n + 1);

    int x,y;
    for(int i = 1; i <= m; i++)
    {
        scanf("%d%d",&x,&y);
        grade[y]++;
        g[x].push_back(y);
    }
}

void topo()
{
    for(int i = 1; i <= n; i++)
        if(!grade[i])
            q.push(i);

    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(int i = 0; i < g[nod].size(); i++)
        {
            grade[g[nod][i]]--;
            if(!grade[g[nod][i]])
                q.push(g[nod][i]);
        }
        printf("%d ",nod);
    }
}
int main()
{
    read();
    topo();
    return 0;
}