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.

3, 7, ['1811', 'Z', 'C', 'x', '6171', 'W', 'N', 'L', 'h', '4497']
6171

2, 9, ['S', 't', '243', '5691', '5695', 'Y', 'd', '8695', 'M', 'K', 'z', 'I', '7325', '8945', 'P', 'Q', 'I', 'N']
20324

5, 26, ['4371', '1809', '8191', 'v', 'W', 's', 'C', 'q', '7077', 'l', 'm', '2793', 'D', '457', '4209', 'x', 'X', '8023', '4893', '4955', '9499', '4495', 'M', '3683', 'N', 'O', '5719', 'O', 's']

50084