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, 19, ['v', 'N', 'm', '3145', 'b', '3651', 'Z', 'y', '3477', 'z', '923', 'z', '3975', '1109', 'x', '1533', '6717', 'r', '519', 'X', 'V', '3641', 'Q', 'f', '5617']