#include "iostream"
#include "vector"
#include "queue"
using namespace std;

#define MAX 505
int InDeg[MAX];
int n, m, Count;
int Ans[MAX];

void TopoSort(vector<int> v[])
{
    priority_queue<int, vector<int>, greater<int> > PQ;
    for(int i=1; i<=n; i++) //找出入度為0的點并放入優先隊列
        if(InDeg[i]==0) PQ.push(i);

    while(!PQ.empty()) //BFS
    {
        int Tmp = PQ.top();
        PQ.pop();
        Ans[Count++] = Tmp;
        for(int i=0; i<v[Tmp].size(); i++)
        {
            InDeg[v[Tmp][i]]--;
            if(InDeg[v[Tmp][i]]==0) PQ.push(v[Tmp][i]);
        }
    }
}

int main()
{
    int x, y;
    while(cin>>n>>m)
    {
        vector<int> V[MAX];
        memset(Ans, 0, sizeof(Ans));
        Count = 0;
        memset(InDeg, 0, sizeof(InDeg));
        for(int i=0; i<m; i++)
        {
            cin>>x>>y;
            InDeg[y]++;
            V[x].push_back(y);
        }
        TopoSort(V);
        for(int i=0; i<Count-1; i++) cout<<Ans[i]<<" ";
        cout<<Ans[Count-1]<<endl;
    }
}