#include <fstream>
#include<vector>
#include<queue>
#include<stack>

using namespace std;

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

/*
vector<int> a[50005];
int nrp[50005], n, m;

int main()
{
    in >> n >> m;
    for(int i = 0;i < m;i ++)
    {
        int x, y;
        in >> x >> y;
        a[x].push_back(y);
        nrp[y] ++;
    }

    queue<int> q;
    for(int i = 1;i <= n;i ++)
    {
        if(nrp[i] == 0)
            q.push(i);
    }

    while(!q.empty())
    {
        int x= q.front();
        out<< x << " ";
        q.pop();
        for(auto y: a[x])
        {
            nrp[y]--;
            if(nrp[y] == 0)
                q.push(y);
        }
    }
    return 0;
}
*/

const int N = 50000;

vector <int> a[N + 1];
bool viz[N + 1];
stack<int> stiva;
int n, m;

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

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

    for (int i = 0; i < m; i++)
    {
        int y, x;
        in >> x >> y;
        a[x].push_back(y);
    }

    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
            dfs(i);
    }

    while (!stiva.empty())
    {
        out << stiva.top() << " ";
        stiva.pop();
    }

    return 0;
}