#include <bits/stdc++.h>
using namespace std;

int n,m1;
vector<int> m[50010];
stack<int> s;

void dfs(int nod)
{
    for(vector<int>::iterator it=m[nod].begin();it!=m[nod].end();it++)
        dfs(*it);
    s.push(nod);
}

int main()
{
    int i,n1,n2;
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m1);
    for(;m1;m1--)
    {
        scanf("%d%d",&n1,&n2);
        m[n1].push_back(n2);
    }
    dfs(1);
    while(!s.empty())
    {
        printf("%d ",s.top());
        s.pop();
    }
    fclose(stdin);
    fclose(stdout);
    return 0;
}