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.
7, 25, ['8469', 'P', '6535', 'I', 'f', '7343', 'd', 'w', '8103', 'Y', 'S', 'R', 'p', 'b', 'N', '8435', 's', '5657', 'c', 'n', 'o', 't', 'U', '9799', 'e', '9429', '2185', '509']