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: 3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']
Example Output: 4477

Example Input: 2, 3, ['3335', '3451', 'f', 'M']
Example Output: 3451

Example Input: 1, 7, ['X', '7267', '3905', '411', '4501', 'k', 'n', '7785', '3895', '3247', 'N', 'I', 'O', '6563', '6949', 'c', '3051']
Example Output:
16084