It is an asynchronous counter.
it goes from $0 , 1 , 2 ...$ so on till it get cleared and returned to $0$ again.
It will return to $0$/Clear when NAND will produce $0$.
That will happen at A and B both are $1$, i.e, ABC at $110$.
But state $110$ will not be counted
we have previous state $101$,
then
$\underbrace{1}^{\text{A}}_{\text{this is old 1 }}\quad \underbrace{0}^{\text{B}}_{\text{Change to 1}}\quad \underbrace{1}^{\text{C}}_{\text{Change to 0}}$
Actually $110$ is not result in states, and counter get cleared (with new B as 1, and Old A as 1).
We get states as $0,1,2,3,4,5,0,1,....$
MOD$6$ Counter.