#include <iostream>
#include <cstdio>
#include <vector>
#include <bitset>
#include <stack>
#define nmax 50010
using namespace std;

int n,m1,nr;
stack <int> sol;
bitset <nmax> viz;
vector<int> m[nmax];

void solve(int nod)
{
    viz[nod]=1;
    for(vector<int>::iterator it=m[nod].begin();it!=m[nod].end();it++)
        if(!viz[*it]) solve(*it);
    sol.push(nod);
}

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