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, ['3985', '6595', '3495', 'Y', 'q', '5917', '113', 'x', '2845', 'E', '7635', 'd', '231', 't', '881', '8701', 'v', '9571', 'A', '8121', '3621', 'U']