#include <bits/stdc++.h>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

#define cin fin
#define cout fout

vector<int> v[1001];
queue<int> q;
int grad[1001];
int n,m,x,y;

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        cin >> x >> y;
        v[x].push_back(y);
        grad[y]++;
    }
    for (int i = 1; i <= n; i++)
    {
        if (grad[i] == 0) q.push(i);
        while(!q.empty())
        {
            x = q.front();
            for (auto y:v[x]) grad[y]--;
            q.pop();
        }
        cout << x << " ";
    }
}