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, 12, ['9949', 'G', 'b', 'm', 'f', '8083', 's', '2115', '4983', '6627', '6569', 's', '2199', 'h', 'o', '2579', 'a', '9339', '4205', 'e', '6559', 'z', 'n', 'Y', '6545', '1601', 'T', 'X', 'A', '4479']