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: 13, 14, ['5297', 'V', '7495', '6967', 'b', 'w', 'a', '2403', 'V', 'n', '525', 'd', 'o', 'm', '3439', '4245', '6381', '5743', 'P', '1047']
Example Output: 0

Example Input: 3, 5, ['X', '8101', 'v', '283', 'v', 'O', 'Y']
Example Output: 283

Example Input: 8, 10, ['9835', 't', 'X', 'e', 'R', '7361', 'y', 'R', 'w', '7451', 'h', '9537', 'd', 'r', 'Z', 'p', '4133', '4571', '1033', '723', 's']
Example Output:
7451