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.
13, 28, ['5881', '5311', 'M', 'Z', 'd', '125', 'O', 'A', '2231', 'C', 't', '2143', 'a', '9699', 'I', '5275', '5595', 'j', '5695', '6407', 't', 'U', '1803', 'o', 't', '2489', '5143', '301', 'B', '3095']