#include <fstream>
#include <vector>
#include <queue>
#include <deque>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m,cnt;
vector<int>g[100005];
vector<int>intern(100005);
deque<int>sol;
void citire()
{
    cin >> n >> m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        cin >> x >> y;
        g[x].push_back(y);
        intern[y]++;
    }
}
void sortare()
{
    deque<int>q;
    for(int i=1;i<=n;i++)
        if(!intern[i])
            q.push_back(i);
    while(!q.empty())
    {
        int p=q.front();
        sol.push_back(p);
        q.pop_front();
        for(int i=0;i<g[p].size();i++)
        {
            intern[g[p][i]]--;
            if(!intern[g[p][i]])
                q.push_back(g[p][i]);
        }
    }
}
int main()
{
    citire();
    sortare();
    while(!sol.empty())
        cout << sol.front() << ' ',sol.pop_front();
    return 0;
}