#include <fstream>
#include <vector>
#include <bitset>

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");

const int N = 5e4 + 4;
int n, m, i, a, b;
bitset<N>viz;
vector<int>G[N];
vector<int>topsort;

void dfs(int nod)
{
    viz[nod] = 1;
    for(int i = 0; i < G[nod].size(); i++)
        if(viz[G[nod][i]] == 0) dfs(G[nod][i]);
    topsort.push_back(nod);
}

int main()
{
    in >> n >> m;

    while(m--)
    {
        in >> a >> b;
        G[a].push_back(b);
    }

    for(i = 1; i <= n; i++)
        if(viz[i] == 0) dfs(i);

    vector<int>::iterator it;
    for(it = topsort.end() - 1;  it >= topsort.begin(); it--)
        out << *it << ' ';

    return 0;
}