For the following language, determine to which class it belongs
$$L_3=\left\{\langle M\rangle\Big\vert|\langle M\rangle|\le 2016\text{ and M is a TM that accepts }\varepsilon \right\}$$
I've seen an answer which claimed that this is a finite language, thus it is decidable. Unfortunately, I do not understand why it is finite.
Any help would be appreciated, thanks!
HINT: What does "$\vert M\vert<2016$" mean? What is $\vert M\vert$? And, how many Turing machines are there of a given size in this sense?
(I am assuming here that I know what you mean by $\vert M\vert$ - you should clarify what this notation means - but I have a very strong guess.)