#include <fstream>
#include <vector>
#include <stack>
using namespace std;

ifstream is("sortaret.in");
ofstream os("sortaret.out");

int n, m;
vector< vector <int> > g;
vector<bool> s;
stack<int> stk;

void Df(int x);

int main()
{
    is >> n >> m;
    int x, y;
    g = vector<vector<int>>(n+1);
    s = vector<bool>(n+1);
    for(int i = 1; i <= m; ++i)
    {
        is >> x >> y;
        g[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i)
    {
        if(!s[i])
            Df(i);
    }
    while(!stk.empty())
    {
        os << stk.top() << ' ';
        stk.pop();
    }
    is.close();
    os.close();
    return 0;
}

void Df(int x)
{
    s[x] = true;
    for(vector<int>::iterator it = g[x].begin(); it != g[x].end(); ++it)
    {
        if(!s[*it])
            Df(*it);
    }
    stk.push(x);
}