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.
15, 28, ['X', '403', '2893', '2381', 'c', 'J', '8829', '3317', 'N', 'l', 'v', '6565', 'K', '2245', 'u', 'j', 'j', 'e', 'Z', '8065', '81', '6147', '7143', '5699', '5877', '2839', '9581', '9671', 'L']