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

const int N = 5e5;
int d[N];
bool viz[N];
vector <int> a[N];
stack <int> s;

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

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

int main()
{
    int n,m;
    in >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x,y;
        in >> x >> y;
        a[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
    {
        if(!viz[i])
        {
            dfs(i);
        }
    }
    while(!s.empty())
    {
        out << s.top() << " ";
        s.pop();
    }
    in.close();
    out.close();
    return 0;
}