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.
[[84, -132, -90], [98, 48, -192, -41], [-178, 26, -127], [18, -152, 21], [-153, -149, 81, -199, -164, 72, -40], [4, 81, 30], [-16, 46, 13, 75], [-166, 15, 89, -105, -19], [-11, 26, 60, -7, -37]]