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.
2, 7, ['j', 'p', 'p', 'C', '667', '9201', 'z', '7343', '8059', '9353', '9649', '3481', '1505', '611', 'b', 's', '7539', '3545', '1965', '2457']