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, 3, ['o', 'p', '4765', 'u', '629', 'p']
Example Output: 4765

Example Input: 1, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']
Example Output: 2957

Example Input: 3, 14, ['m', '4757', 'Z', 'k', 'X', 'M', 'X', '5043', '2547', 'r', '5667', 'g', '8549', 'F', '683', '5897', 'w', '9089']
Example Output:
21806