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: 7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']

Output: 0


Input: Consider Input: 1, 11, ['4195', 'G', '3905', '8825', 'J', 'I', 's', 'd', '2681', 'g', '3873', 'N', '9349']

Output: 23479


Input: Consider Input: 3, 7, ['9775', '3637', '7935', '1181', '7527', 'D', '5411', '3973', '2889']


Output: 22054