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: 5, 15, ['r', '6933', '8849', '3479', 'H', '4269', '7469', '9359', 'K', '3371', 'A', '5371', 'z', 'K', '6147', 'i', 'Q', '9055', 'b', 'g', 'x', '5357', 'L', '2797', '7683', 'L', '7127', 'M']
Example Output: 35986

Example Input: 14, 18, ['y', '4021', '9011', '3447', '6467', '5599', 'T', 'g', '1441', 'e', '2857', '7251', 'D', '619', '6413', '3145', '9355', 'O', 'Z', '6521', '5005', 'Q']
Example Output: 19532

Example Input: 2, 2, ['U', 'A', '5947', 'J', '4737']
Example Output:
0