import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); List> graph = new ArrayList<>(); PriorityQueue queue = new PriorityQueue<>(); for (int i = 0; i < n; i++) { graph.add(new ArrayList<>()); queue.add(new Path(i, i)); } for (int i = 0; i < m; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; graph.get(b).add(a); } long[] values = new long[n]; while (queue.size() > 0) { Path p = queue.poll(); if (values[p.idx] >= p.value) { continue; } values[p.idx] = p.value; for (int x : graph.get(p.idx)) { queue.add(new Path(x, p.value)); } } System.out.println(Arrays.stream(values).sum() + n); } static class Path implements Comparable { int idx; int value; public Path(int idx, int value) { this.idx = idx; this.value = value; } public int compareTo(Path another) { return another.value - value; } } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }