In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
6, 8, ['t', '3101', '5631', '3557', '3693', '3575', 'i', '8947', '3855', 'c', 'C', '9211', '2909', 'P', '4933', 'Q', '377', 'Q']