#include <fstream>
#include <vector>
#include <stack>

using namespace std;

ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

const int MAX = 1e5 + 1;
vector<int> adj[MAX];
stack<int> s;

int n, m, viz[MAX];

void dfs(int nod)
{
    viz[nod] = 1;

    for(unsigned i = 0; i < adj[nod].size(); ++i)
    {
        int fiu = adj[nod][i];

        if(viz[fiu] == 0)
        {
            dfs(fiu);
        }
    }

    s.push(nod);
}

int main()
{
    cin >> n >> m;

    for(int i = 1; i <= m; ++i)
    {
        int x, y;
        cin >> x >> y;
        adj[x].push_back(y);
    }

    for(int i = 1; i <= n; ++i)
    {
        if(viz[i] == 0)
        {
            dfs(i);
        }
    }

    while(!s.empty())
    {
        cout << s.top() << ' ';
        s.pop();
    }
    return 0;
}