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]: 2, 17, ['J', '505', '9301', '6263', 'W', '901', '1441', '595', '7877', '4597', '409', 'j', 'Y', 'P', '4737', 'f', 'H', 'u', 'B', 'V', '6661', 'e']
[A]: 36626


[Q]: 1, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']
[A]: 4866


[Q]: 13, 20, ['l', '103', 'o', '2749', '1877', '3453', '6473', 'V', '117', 'C', '6699', '7199', 'X', '2591', 'x', '5433', '9031', 'n', 'a', 'o', '8097', '31', '7697']
[A]:
17055