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.
11, 14, ['F', '1663', 'r', 'Y', 'i', 'H', '6857', 'A', 'J', 'X', '7951', 'D', '509', '9197', '2397', 'e']