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: 16, 23, ['N', '3357', '919', '9963', 'u', '137', '5633', '2999', 't', '1583', '2217', 'p', '1087', '7219', '61', 'p', 'L', '5745', '4431', 'T', '4369', 'G', '1511', 'p', 'M', '4277', '6683', 'C', 'D']

Output: 16056


Input: Consider Input: 2, 8, ['4517', 'w', '9145', '5477', '7679', 'j', '8603', 'z']

Output: 30904


Input: Consider Input: 9, 16, ['4169', 'M', '3569', 'V', 'P', 'w', '8221', 'C', '7853', 'z', 's', '9301', 't', '6083', 'B', '1137', 'Z', 's', 'V', '731']


Output: 24374