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, 20, ['t', 'K', 'H', 'S', 'X', 'F', '1419', 'B', '5373', 'e', '5069', '9421', 'd', '755', 'M', '6783', 'I', 'v', '8849', '3455', '63', 'V']