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, 17, ['8815', '4603', '6903', 'o', 't', 'P', 'p', 'D', 'S', '7693', '4685', '9271', '7443', 'j', 'T', 'T', '1597', '769', 'a']