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.
2, 9, ['B', 'm', 'v', '4095', '2309', 'i', '8565', 'W', '2633', 'h', '7383', '7709', 'D', 'h', '6693', '1293', '8103', 'd', 'k', '665', '3823', 'R', 'p', '2057', 'T']