Definition: 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.
Input: 16, 28, ['O', 'b', 's', '5325', 'V', '2469', '9615', '3111', 'U', 'C', 'j', '3857', '477', 'w', '2057', 'm', 'g', '7431', 'I', 'P', 'D', '3385', '9713', 'W', 'W', 'F', 'J', '9195']

29724