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.
[[1, -36, -43, -140, 7, -89, -21], [79, -191, 10, -184, 5], [33, -63, 15, -37, -177, -93], [-6, -176, -25, -78, -45, 100], [-7, -133, -191]]