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.
15, 25, ['B', 'M', 'v', '8731', 'b', '631', 'U', 'W', 'A', '9497', 'P', 'W', '7671', 'M', '8323', '9405', '8317', '3943', 'L', 'n', '1625', 'v', 'A', 'b', '9721', 'i', 'Q']