The trickle, the flow and the flood of the application: basic idea; the fundamental lemma of labeled counting; the exponential formula; the fundamental lemma of unlabeled counting; Schur's theorem. Examples include: # of particular subclasses of permutations; set partitions; involutions; counting 2-regular graphs; connected graphs; labeled bipartite graphs; labeled tree; partitions of integers, etc.