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.

3, 6, ['7073', '3047', 'O', 'c', 'u', 'G']
0

9, 9, ['8633', 'O', 'N', '3323', '1975', '8707', 'c', 'm', '8357', 'A', 'n', '8931', '9021', 'i']
8357

7, 10, ['6517', '3279', 'N', 'c', 'C', '8267', '2589', '5317', '2341', '6491', 't', 'Y', '2695', 'D', 'a', '8329']

16738