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, 5, ['X', '8101', 'v', '283', 'v', 'O', 'Y']
Example Output: 283

Example Input: 2, 4, ['X', 'o', '8807', 'r', 'q', '825']
Example Output: 8807

Example Input: 6, 14, ['4781', '7533', 'F', '6799', 'E', '1319', '599', 'm', '2145', 'a', '5201', 'x', '6011', 's', '881', '2441']
Example Output:
15275