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, 4, ['261', '6237', '3809', '1857']

Output: 12164


Input: Consider Input: 13, 13, ['291', 's', '6185', 'H', 'N', 'x', '3467', 'T', '9029', 'H', 'h', 'e', '2075', '1909', '1187', '1745', '7517', 'u', 'R', 'I']


Output: 2075