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.
14, 16, ['933', 'h', 'X', '4663', '5397', '5061', '7291', 'M', '4067', '5477', '3807', '8049', 'o', '295', '3515', 'j', 'y', '1033', 'q', 'o', 'Z', '8461']