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: 3, 6, ['w', 'V', '7413', '5027', 's', '7037', 'S', '763', 'D', 'U', 'x', 'l', '9331', 'S', 'k', '8369', 'D', 'A', 'e', 'A', 'r', '5113', '1367', '4197', 'm']

Output: 19477


Input: Consider Input: 3, 5, ['i', 'e', '6583', '313', '5511']

Output: 12407


Input: Consider Input: 5, 11, ['J', 'k', '437', '6493', '9279', 'K', 'W', '6035', '2471', 'd', '3313', '9581', '9357', 'p', '9653', '7875', '4269', 'u', 'V', 'o', '2799', 'I', 'Q', '4897']


Output: 21098