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, 6, ['1529', '2989', 'T', '8059', 'f', 'j', 'x', '2209']

A: 12577
****
Q: 9, 12, ['4189', '4575', 'i', 'e', 'Y', '5595', 'U', 'M', 'b', 'n', '5347', 'v', 'w', 'Z', 'F', '503', 'G', '4429', '3087', '295', 'W']

A: 5347
****
Q: 1, 24, ['8337', '585', '1221', '1527', 'O', '7477', 'd', '4309', 'n', '2843', '7201', '1897', '4981', '2169', 'l', '6739', '6341', '7887', 'q', 'l', '5435', '3341', '9449', '961', 'S', 'H', 'C', 'V', 'm', '7917']

A:
82700
****