#include <fstream>
#include <vector>

using namespace std;

int n;
vector<bool> s;
vector<int> q;
vector<vector<int> > v;

void DF(int nod)
{
    int i, x = v[nod].size();
    
    s[nod] = 1;
    for (i = 0; i < x; i++)    
        if (!s[v[nod][i]]) DF(v[nod][i]);
        
    q.push_back(nod); 
}

int main()
{
    int i, x1, x2, m;
    ifstream fin("sortaret.in");
    fin >> n >> m;
    
    v.resize(n+1);
    s.resize(n+1);
    
    for (i = 1; i <= m; i++)    
    {
        fin >> x1 >> x2;
        v[x1].push_back(x2);    
    }
    fin.close();
    
    for (i = 1; i <= n; i++)
        if (!s[i]) DF(i);
    
    ofstream fout("sortaret.out");
    while (!q.empty())
    {
         fout << q.back() << " ";
         q.pop_back();      
    }
    fout << "\n";
    fout.close();
    
    return 0;
}