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.

Ex Input:
2, 4, ['7815', '573', '8607', 'y', '6107', '9063', 'f']

Ex Output:
9180


Ex Input:
6, 16, ['P', '8933', '2757', 'y', 'p', '6687', '6903', 'S', 'b', '7221', 'V', 'B', '3633', 'G', '1209', 'J', '641', '1449', 's', 'w', 'C', '5801', 'Y']

Ex Output:
25653


Ex Input:
8, 15, ['8011', '7311', 'k', 'p', '7309', 'T', '5707', 'q', '9323', '4207', '9799', '4593', '6521', 'I', 'D']

Ex Output:

34443