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


using namespace std;

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

int viz[100005], v[100005], x, y;

vector<int>s[100005];
stack<int> stiva;

void dfs(int x)
{
    viz[x] = 1;
    for(auto y:s[x])
    {
        if(!viz[y])
        {
            dfs(y);
        }
    }
    stiva.push(x);
}

int main()
{
    int m, n;
    fin>>n>>m;
    for(int i = 0; i < m; i++)
    {
        fin>>x>>y;
        s[x].push_back(y);
    }
    //dfs(1);
    for(int i = 1; i <= n; i++)
    {
        if(viz[i] == 0)
        {
            dfs(i);
        }
    }
    for(int j = 0; j < n; j++)
    {
        fout << stiva.top() << " ";
        stiva.pop();
    }
    return 0;
}