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.
5, 9, ['b', 'C', 'K', 'u', '4207', 'Z', '673', 'K', '4141', 'i', '6453', 'z', '13', '5195', 'U', 'X', '9055', 't', 'V', '5443', 'r', '2171', 'S', 'J']