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.
13, 16, ['x', 'h', 'V', '3955', '5069', '4811', 'Y', 'X', 'b', 'V', '989', 'd', 'P', '6089', 'E', '1645', 'y', 'X', '4145', 'z', '9403', 'r', '6061', '7673', 'E']