In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[29, -38, -11, -166], [-72, 19, 79, -28], [-100, -63, 40, -27, -135, 51, 62], [69, 88, 63, 19, -80, 86], [42, -106]]