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.
5, 27, ['Y', '315', '3539', 'j', 'N', 'X', 'e', 'I', '2289', 's', 'Z', '1315', '2249', 'O', 'U', 'd', 'U', 'k', 'z', 'J', 'e', 'R', '877', 'D', 'W', '2387', '4905', '3283', '5241']