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, 15, ['U', 'E', '6873', '7621', '9241', '147', '4503', 'z', '3805', 'n', '4331', '4031', '2585', '9029', 'a', '7537', '975']
28431

2, 7, ['C', 'C', '9639', '7815', 'N', '1713', '8339', '4237']
27506

3, 9, ['901', 'N', '1599', '2845', 'Z', 'z', '4387', 'r', 'O']

8831