Is L = {: M accepts a word whose length is at most 200} decidable?

I have a language consisting of all Turing machines that only accept words "σ" with |σ| ≤ 200 and I need to determine if it is decidable, but it doesn’t look like any problem I have solved before. Any ideas?