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: 7, 18, ['o', '3007', '4747', '869', 'H', '7455', 'U', 'G', '6009', 'H', 'p', '381', '5217', 'q', '1251', 'G', 'i', 'X', '7649', '415', '8053', 'o']

A: 12858
****
Q: 11, 27, ['1573', '6065', '869', '77', '9665', 'o', '8359', 'g', '3557', '521', '6797', '5117', '3921', '5707', 'k', '9855', '8415', 'Y', 'l', 'S', '385', '9063', '8975', '2047', 'H', 'p', 'p']

A: 60282
****
Q: 3, 4, ['L', '5991', 'g', '379']

A:
379
****