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, 21, ['4171', 'n', '7521', '2575', 'e', 'r', 'U', '4033', 'h', 'Y', 'K', 'b', 'l', 'K', '3233', '7401', '6089', '8617', 'd', '6141', '5333', '9413', '9375', 'w', 'i']