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.
[[19, -30, -96, -29, -26], [48, -123, 79, 60], [-8, -41, 76, -136, -42, -188, 98], [8, 99, -64, -163, -128, 8]]