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.

Example Input: 2, 2, ['V', 'a']
Example Output: 0

Example Input: 1, 3, ['F', 'N', 'N', 'r', 'X', 'R', '3477', 'T', 'z', 'v', 'B', 'Q']
Example Output: 0

Example Input: 1, 13, ['5851', '373', 'H', 'b', 'B', 'I', 'k', 'w', 'h', 'c', 'p', 'q', '9885']
Example Output:
16109