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.
[[-153, 73, -153, -169, 8, -22, -188], [-46, -140], [81, -6, -44, -143, -162, -29, 100], [-190, 91, -190], [-101, -109, 43, -136, -62, -44, -139]]