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: 9, 9, ['8633', 'O', 'N', '3323', '1975', '8707', 'c', 'm', '8357', 'A', 'n', '8931', '9021', 'i']

A: 8357
****
Q: 1, 1, ['2821', '3823', '9741', 'k', 'X', '2457']

A: 2821
****
Q: 2, 8, ['427', '695', 'o', '3763', 'F', 'r', '9249', 'B', '8231', '9813', '1667', '8015', '8159']

A:
13707
****