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, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']

A: 33375
****
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: 9, 16, ['W', '7823', '8873', 'I', 'o', 'i', '5945', '8639', 'n', 'L', 'Y', '695', '9231', '843', 'C', '3735', 'P', '953', 'A', '1311', 'M', 'W', 'i', '4037']

A:
14504
****