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.
20, 24, ['b', 'g', 'i', 'z', 'N', '9265', 'R', '6901', '3245', '2529', '5091', 'j', '9025', '7487', 'B', '9721', 'h', '6555', 'L', 'a', 'W', 'g', 'P', 'W', 'k', '8331']