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, 23, ['2753', '3737', '8925', 'Z', 'T', 'G', '2997', 'B', 'M', 'd', '6869', 'L', '7411', 'c', '141', 's', '5537', '3099', 'M', '1883', '9013', 'E', '8139', 'N', '8003', 'U', '5167', 'g', 'Y']