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.
8, 17, ['8781', '3181', '2665', 'P', '1943', 'I', '8595', 'Q', '6271', 'H', '9333', 'F', 'U', '1451', 'z', 'e', '9417', '8157', 'f', '6581', 'v', '1995', 'S', '2321', 'P', '8769']