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.
10, 17, ['t', 'A', '4287', 'I', '4873', 'T', '2807', '9847', 'U', 'K', '8797', 'J', 'v', 'T', '3399', '1225', '141', '4805', 'h', 'D', 'O', '6623', '785', 'N', 's', 'J', '665', 'c', 'M', 'k']