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

using namespace std;
queue <int> q;
int pred[50005],sol[50005];
vector <int> s[50005];

int main()
{
    freopen("sortaret.in", "r",stdin);
    freopen("sortaret.out", "w",stdout);
    int n,r,i,x,y,k;
    scanf("%d%d", &n, &r);
    for(i = 1;i <= r;i++)
    {
        scanf("%d%d", &x, &y);
        pred[y]++;
        s[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 < s[x].size();i++)
        {
            pred[s[x][i]]--;
            if(!pred[s[x][i]])
                q.push(s[x][i]);
        }
        sol[++k] = x;
        q.pop();
    }
    for(i = 1;i <= k;i++)
        printf("%d ",sol[i]);
    return 0;
}