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: 4, 8, ['6669', 'G', 'y', '129', 'y', 'x', 'w', 'C', 'J']

Output: 129


Input: Consider Input: 1, 15, ['t', '77', '6593', '3683', '5673', '9391', 'Y', 'A', '3273', '379', '6569', 'l', 'u', '8633', 'M', '8587', '3127', '5885', '4083']

Output: 44271


Input: Consider Input: 4, 7, ['5921', 'n', '2993', '2799', 'S', '1345', 'L', '9373', 'd', '9867', 'D']


Output: 4144