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: 6, 20, ['x', 'z', '271', 'M', '1727', '9453', '4017', 'o', '8109', 'X', '5989', '275', 'V', '3019', 'Z', 'K', 'L', '3885', '8699', '6241']
Example Output: 49687

Example Input: 13, 16, ['7509', 'R', 'a', 'V', '6365', '9597', 'y', '6295', 'M', 'X', 'K', 'O', '1577', 'u', 'D', '6835', '4783', '5355', 'B', 'g', 't', 'm', '7205', '979', '4465', 'C', '6921']
Example Output:
8412