#include<cstdio>
#include<vector>
#include<queue>
using namespace std;

FILE* in=fopen("sortaret.in", "r");
FILE* out=fopen("sortaret.out", "w");
vector<int> v[50007];
int g[50007];
queue<int> q;
int n, m;

int main()
{
    fscanf(in, "%d%d", &n, &m);

    int x, y;
    for(int i=1; i<=m; ++i)
    {
        fscanf(in, "%d%d", &x, &y);
        v[x].push_back(y);
        g[y]++;
    }
    for(int i=1; i<=n; ++i)
    {
        if(!g[i]) q.push(i);
    }
    while(!q.empty())
    {
        int nr=q.front();
        fprintf(out, "%d ", nr);
        q.pop();
        for(int i=0; i<v[nr].size(); ++i)
        {
            --g[v[nr][i]];
            if(!g[v[nr][i]])
            {
                q.push(v[nr][i]);
            }
        }
    }
}