Priority inversion
Because M does not require resource R, so it is able to run while L still has it in use; H, on the other hand, cannot run until L is able to release R.
Because M does not require resource R, so it is able to run while L still has it in use; H, on the other hand, cannot run until L is able to release R.