<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:

def get_max_sum_ind(self, indices_list, distances, i, m):
        '''Get the indices that belong to the maximum distance in `distances`

        Arguments
        ---------
        indices_list : list
            list of tuples
        distances : numpy.ndarray
            size M
        i : int
        m : int

        Returns
        -------
        list
        '''
        if len(indices_list) != len(distances):
            msg = "Indices and distances are lists of different length." + \
                "Length indices_list = {} and length distances = {}." + \
                "In loop i = {}  and m =  {}"
            raise ValueError(msg.format(
                len(indices_list), len(distances), i, m))

        max_index = tuple(distances.argsort()[-1:][::-1])
        return indices_list[max_index[0]]