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.
17, 20, ['q', '3857', 'C', 'D', 'd', '3813', 'i', 'T', 'T', '4759', '3605', 'F', '3387', 'K', '599', '7169', '3749', '699', 'e', 'u', 'w', '3101']