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.

Q: 1, 3, ['5437', '8521', '9081', 'h', '5453', '5065', '2949', 'P', 'Q', '2853', '7857', 'l', '5217', 'O', 'V', '3585', 't', '2593', 'V']

A: 23039
****
Q: 16, 23, ['N', '3357', '919', '9963', 'u', '137', '5633', '2999', 't', '1583', '2217', 'p', '1087', '7219', '61', 'p', 'L', '5745', '4431', 'T', '4369', 'G', '1511', 'p', 'M', '4277', '6683', 'C', 'D']

A: 16056
****
Q: 9, 11, ['2003', '4567', 'd', '9473', 'X', 'C', '2241', 'v', '1723', '7067', '5169']

A:
13959
****