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.
[[89, -83, -196, -29, 40], [86, -49, -34], [-16, -30, -135], [-120, 7, -160, -11, -109], [-12, -59, -71, -196], [-80, -155, -85], [-44, -138, -59, -7, -76, 1, -133], [-90, -111, -174, 46]]