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: 16, 23, ['g', 'p', '7457', 'l', 'a', 'a', 'C', '6307', 'G', '5453', '1165', 'W', '6419', 's', '9445', 'y', 'Y', 'F', '9703', '4049', 'Y', '7173', 's', '7925', 'Z', '4413', 'd', '649']

A: 20925
****
Q: 3, 5, ['c', '9619', 'e', 'A', '5045', '2453', 'L', '553', '5493', '5657']

A: 5045
****
Q: 3, 4, ['8703', 'J', 'N', 'K', 'F', '9933', 'P']

A:
0
****