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.
23, 25, ['v', '9483', '1619', '8847', 'S', 'c', 'T', 'T', 'f', 'v', '4405', 'x', 'E', 'U', '9583', 'P', '2739', 'W', 'N', 'd', 'b', '113', 'h', 'Z', '267', '6113']