How many ways are there to permute the letters $\{S, C, R, A, M, B, L, E\}$ without the permutation containing the substring $LAME$?

Let's think step by step and output the final answer within \boxed{}.
user