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, 25, ['z', 'N', 'd', '6289', '7899', '6217', 'K', '3215', 'J', 'B', 'k', 'V', '369', '9239', 'K', '2087', '1663', 'f', 'H', '1363', 'r', '4305', 'S', '5003', 'K']