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.

Q: 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']

A: 23353
****
Q: 2, 2, ['V', 'a']

A: 0
****
Q: 27, 30, ['6483', '1207', 'x', '9313', '8023', '4873', '8109', '2047', '7819', 'n', '8747', 'X', 'K', 'w', 'W', '9513', '6807', '3251', 'W', 'U', 'N', '1615', 'r', '9837', '8839', 'j', 'v', 'S', 'E', '1605']

A:
1605
****