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.
11, 28, ['Y', '6559', 'R', 'I', 'H', 'J', 's', '507', '4549', '9437', 'f', '8109', '4225', '9923', 'o', '4221', '1423', '7949', '6913', '1449', 's', 'R', '8117', 'v', '4005', '2433', '1175', 'O']