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.
[[-28, -119, 61, 35], [-26, -105, -119, -144], [-67, -42, -129, -197, -165], [-14, -26, 82, -154, -24, -160, -195], [-46, -91, -144, -196, -21]]