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.

28, 29, ['9439', '4749', 'b', '5065', 'W', '3631', '4647', '2367', '7155', 'X', 'R', '7889', '3135', '5547', 'C', 'j', 'b', 'e', 'U', 'Y', '8799', 'z', 'h', '7759', '1913', '6103', 'y', 'M', 'B']
0

4, 12, ['f', '3507', 'T', 's', '9209', 'T', 'o', '769', 'U', 'i', 'V', '5723', '2151', 't', 'Z', '5857', '951', '3261', 'd', '407', 'X', '1869', '1483', '3631', '2949']
15701

5, 25, ['8577', '5559', 'k', '9293', 'E', 'N', 'd', '4377', 'e', 'K', 'h', 's', 'U', 's', '5735', '2907', '2319', '5721', '6277', '7885', '1293', '1299', 'T', 'w', '4145', 'w', 'l']

41958