A combinatorial map (= embedded graph, = ribbon graph, = fat graph, = ...) has vertices, edges, and faces. It happens that for many other combinatorial structures we can enumerate vertices, edges, or faces even in the situations where we are unable to define them. These numbers play a crucial role in understanding weight systems, worth studying attentively