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

#define nmax 50001
#define mmax 100001

using namespace std;

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

int n, m;
bool viz[nmax];
vector <int> G[nmax];
stack <int> s;

void read()
{
    
    int x, y;
    
    fi >> n >> m;
    
    for (int i = 1; i <= m; i++)
    {
        
        fi >> x >> y;
        G[x].push_back(y);
    
    }
    
}

void sortaret(int nod)
{
    
    viz[nod] = true;
    
    for (int i = 0; i < G[nod].size(); i++)
    {
        
        int vecin = G[nod][i];
        
        if (!viz[vecin])
            sortaret(vecin);
        
    }
    
    s.push(nod);
    
}

void solve()
{
    
    for (int i = 1; i <= n; i++)
        if (!viz[i])
            sortaret(i);

}

void write()
{
    
    while (!s.empty())
    {
        
        fo << s.top() << " ";
        s.pop();
    
    }
    
}

int main()
{
    
    read();
    
    solve();
    
    write();
    
    fi.close();
    fo.close();
    
    return 0;
}