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, 6, ['l', 'C', '6183', 'd', '6519', 'm']

Output: 12702


Input: Consider Input: 4, 10, ['B', 'b', '6741', '9121', 'N', '2871', 'Z', '1685', '995', '8681', '8591', 'z', '7423', '8661', 'R', 'b', 'g', 'Z', '5679', '4217', 'h', '8497', '3261', '6891', '2145', 'Y']

Output: 23353


Input: Consider Input: 9, 15, ['F', 'S', '237', 'N', '8483', '8291', '4939', 'W', 'r', 'W', '3437', 'a', '9233', 'A', 'I', '7005', '2129']


Output: 12670