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, 4, ['2977', 'i', 'l', 'r', '8835', '7697', 'p', '1685', 'h', 'N', 'Z', '8661', '6003', '7007', 'D', 'C']

Output: 0


Input: Consider Input: 1, 18, ['1137', '7521', '1291', 'o', '391', '5329', 'X', '391', 'i', '6893', '8547', '9361', 'Z', 'O', '9701', '4097', '9273', '3877', '1589', '9097']

Output: 67809


Input: Consider Input: 11, 11, ['X', '6381', '7641', '6189', '6537', '8599', 'Q', 'u', 'h', 'T', '6505', '8539', '1645', 'v', 'm', '1267', 'b', '1683', 'Z', 'm', 'C', 'C', '1875', '7653']


Output: 6505