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.
[[-175, -167, -52, -109, 83], [-96, -34, -59, 100, -191], [73, -151, -171, 10, -144], [-101, -187, -5, -164, -33, -18], [47, 40], [-112, -199]]