#include <cstdio>
#include <vector>
#include <stack>

using namespace std;

int n, m, x, y;
int d[100005];
vector <int> v[100005];
stack <int> s;

void sortareDfs(int nod)
{
    d[nod]=1;
    for(auto vecin:v[nod])
    {
        if(d[vecin] == 0)
            sortareDfs(vecin);
    }
    s.push(nod);
}

int main()
{

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

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

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

    for(int i=1; i<=n; i++)
    {
        if(d[i] == 0)
            sortareDfs(i);
    }
    while(!s.empty())
    {
        int nod=s.top();
        s.pop();
        printf("%d ", nod);

    }
    return 0;
}