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.
[[71, -74], [-145, -139, -19, -146, -135, -175], [-194, -82, 29, -44], [-20, -170, 24, 85, -135], [-190, 43, -136], [45, 86, -19, -108, -119, -184, -121], [-37, -35, -28, -12], [-13, -196, -94, -49, -39, -157], [-15, 69, 61, -31, -156, -63]]