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.
19, 23, ['z', 'J', '7047', 'w', 'v', '109', 'c', 'N', 'X', '8973', 'C', 'K', 'p', 'E', 'r', '9903', '3611', 'B', '5351', 'P', 'Y', 'e', '1005', 'I']