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: 2, 3, ['u', '7053', '303', '329', 'D']

Output: 7356


Input: Consider Input: 5, 6, ['6675', '1045', '5697', '8385', 'R', '8979', '2187', 'L', 'w', '9711', 'e', '9789', 'f', 'c', 'C', '8189', '131', '8163']

Output: 8979


Input: Consider Input: 2, 7, ['c', '4857', '1753', 'M', '7473', '683', '5389', 'F', 't', '4013', 'r', 'Z', 'f', '883', '4897', 'b', 'm', '2419', 'H']


Output: 20155