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.

5, 6, ['937', '3595', '1279', '8705', '3587', '5879']
9466

1, 2, ['4001', 'e', 'm', 'Q', 'T', 'a', '2909', '4043', 'O', 'L', '3401', 'Y', '4015', '2045', '3881', 'd']
4001

1, 12, ['8521', '2797', '8187', 'X', 'a', '3109', 'V', 'Y', '5635', 'b', 'D', '5553', 'E']

33802