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.
17, 20, ['5595', 'E', 's', 'w', '6775', '673', 'M', '7263', '4947', 'U', 'U', '1525', 'D', '5739', '7303', '8145', '373', '89', '2263', 'R', '9087', 'T', '5193']