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.

1, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']
2957

3, 21, ['X', 'Z', '749', '5557', '9991', 'T', '3461', '335', 'I', 'J', '7113', 'b', '2683', '653', '3951', '4193', 'J', '7179', 'G', 'Y', '6151', '2873', 'X', '5619', '5151', '7689', '5605', 'o']
52016

4, 8, ['1319', '2493', 'f', '8613', 'f', '9501', 'W', 'd', 'M', '6159', 'R', 'K', '7711', '795', '8801', '1801', '23', '5775', '71', 'p', '6387', '4929', '5143', 'q', '7141', '8449']

18114