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.
10, 16, ['2199', 'X', 's', '2649', '7643', 'D', '7685', '1509', '391', '4061', 'E', 'c', 'B', '9109', '6541', 'P', '7407', 'c', 'E', 'a', '3145', 'w', '4983']