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.
21, 25, ['457', 'h', '847', 'O', '5589', '9603', 'T', 'Y', '1657', '3589', '9861', '1107', 'j', '2729', '9867', 'm', '3273', '77', 'b', 'k', '7609', 'A', '1339', 'y', 'N', 'l', 'F', 'i']