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]: 3, 15, ['q', '3851', '3631', 'z', '6681', 'Z', '461', 'K', 'P', 'i', '9039', '5929', '1415', 'o', 'O', 'H', '4047', 'B', '7073', '2087', 'I', '6857', '5751', '3633', 'U', '869', 'n', 'h', '7807', '469']
[A]: 27156


[Q]: 3, 10, ['x', '5071', '6421', '5701', 'l', '5659', 'P', '7975', 'z', 'p', 'B', 'q', '1275', 'v', '6471', 'o', 'Q', 'F', '1845', '6063', '3277', '9039', '4209', '2869', '2293', '4517', '577', '3375']
[A]: 25756


[Q]: 4, 7, ['5125', 'A', '8507', '689', '8497', '4651', '4669']
[A]:
18506


