#include <iostream>
#include <vector>
#include <queue>
#include <fstream>

using namespace std;

void citire(vector<int> G[], int &n)
{
    int m,x,y;
    ifstream fin("sortaret.in");
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
}

void sortaretopo(vector <int> G[], int n)
{
    queue <int> q;
    int grad[100]= {0};
    ofstream fout("sortaret.out");
    for(int i=1; i<=n; i++)
        for(int j=0; j<G[i].size(); j++)
            grad[G[i][j]]++;

    for(int i=1; i<=n; i++)
        if(grad[i]==0) q.push(i);

    while(!q.empty())
    {
        int nod=q.front();
        fout<<nod<<" ";
        q.pop();
        for(int j=0; j<G[nod].size(); j++)
        {
            grad[G[nod][j]]--;
            if(grad[G[nod][j]]==0)
                q.push(G[nod][j]);
        }
    }
}
int main()
{
    int n;
    vector<int> G[100];
    citire(G,n);
    sortaretopo(G,n);
    return 0;
}