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.
1, 16, ['h', '3509', '2585', 'L', '9433', '261', '6869', '105', '433', '8067', 'W', '53', 'y', '6809', 'W', 'H', 'J', '4211', '8037', '6745', '405', '1875', '9351', 'u', 'r', '6429', '5665', 'R']