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.
[[57, 29, 74, 35, -5, -111], [-36, -140, 37, -112, -153], [-64, -97], [-16, 90], [-12, -26, -147], [60, -80, 80, -119, -11, -181, -136]]