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: Consider Input: 8, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']

Output: 203


Input: Consider Input: 3, 4, ['6203', 'g', '471', 'j', 'o', '9679', 'M', '5459', 'y', '1929', '1649', 'C']

Output: 471


Input: Consider Input: 5, 20, ['D', '9583', '7495', 'M', 'v', '9791', '7919', '8603', '3325', 'C', 'S', '2751', '5603', '1173', 'y', '8471', 'w', '7607', '93', 'N', '1965', '179', 'E', 'c', 'j']


Output: 55336