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.
6, 11, ['L', 'b', '9455', 'B', '2511', '8057', 'N', '8869', '1223', 's', 'W', '2015', '591', '5359', 'Y', 'q', '837', '1715', 'E', 'c', 'M', '5871']