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]: 11, 20, ['8031', 'v', 'p', '4015', 'v', '3299', '4143', '445', 'I', 'L', 'm', 'u', '7963', '8085', 'c', 'k', 'I', 'A', '8433', '1897', 'g', 'x', '5935', '5195', 'W', 'j', 'A']
[A]: 26378


[Q]: 11, 12, ['S', 'f', 'V', '7983', 'O', 'k', '699', '2831', 'C', 'B', 'B', '1263', 'b', '509', '8963', '8895']
[A]: 1263


[Q]: 5, 16, ['741', '3915', '4117', '349', 'P', 'l', 'Z', '3251', '961', 'l', '4895', '5371', 'p', 'W', 'h', '1987', '4641']
[A]:
16465