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: 8, 8, ['9433', '6635', 't', '4425', 'R', '5893', 'z', 'P', 'V', 'f']
Example Output: 0

Example Input: 3, 8, ['g', 'D', 'W', 'q', '7817', '9295', '2385', 'V', 'c', '7761']
Example Output: 19497

Example Input: 4, 4, ['d', 'f', 'B', '6701', 'G', 'j', 'D', '9235', 'V', '6159', 'p', 'O', 'X', 'I', '4089', 'a']
Example Output:
6701