#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <random>
#include <assert.h>
using namespace std;

const string file = "sortaret";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f; 

//#define ONLINE_JUDGE

void dfs(int x, vector<bool>& viz, vector<int>& Sol, vector<vector<int> > & G)
{
    viz[x] = true;
    for(vector<int>::iterator itr = G[x].begin();
            itr != G[x].end();
            itr++)
    {
        if(viz[*itr] == false)
        {
            dfs(*itr, viz, Sol, G);
        }
    }
    Sol.push_back(x);
}

int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fin(infile.c_str(), ios::in);
	fstream fout(outfile.c_str(), ios::out);
#endif	

    int N, M;
    fin >> N >> M;
    vector<vector<int> > G(N+1);
    for(int i = 0; i < M; i++)
    {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }

    vector<bool> viz(N + 1);
    vector<int> Sol;

    for(int i = 1; i <= N; i++)
    {
        if(viz[i] == false)
        {
            dfs(i, viz, Sol, G);
        }
    }
    for(vector<int>::reverse_iterator itr = Sol.rbegin();
            itr != Sol.rend();
            itr ++)
    {
        fout << *itr << " ";
    }
    fout << "\n";
#ifdef ONLINE_JUDGE
#else
    fout.close();
	fin.close();
#endif
}