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.
12, 16, ['8131', 'U', 'I', 'f', '8909', '1649', '2445', '4419', 'a', 'X', 'r', '1363', '2883', '6171', 'd', '113', '4149', '3339']