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, 25, ['L', 'n', 'C', '3873', '5303', '7395', 'M', '8301', '4339', 'c', '8395', '3909', 'y', '8151', 'r', '6587', 'F', '1715', 'I', '4997', 'K', '7201', '9591', '2497', '1391', 'D']