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, ['V', 'm', 'Z', '5209', '8839', 'K', 'Y', '8429', '2895', '3799', 'x', '7101', 'o', 'X', '2359', '2857', '785', '4605', 'z', '2525', 'y', '4943', 'R', '8405', '6873', 'V']