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.
9, 11, ['s', 'v', '3209', '7021', '9469', '8169', '9273', 'm', 'X', 'Y', '6279', 'm', '61', 'x', '6569', '809', 'n', 'd', 'l', 'R', 'I', 'G']