Graph Algorithms · Easy problem

A project has tasks $k,l,m,n,o,p$ with prerequisites $k \to l, k \to m, l \to n, m \to n, m \to o, n \to p, o \to p$. How many of the OTHER tasks must be completed (directly or indirectly) before $p$ can start?