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.

[EX Q]: 3, 6, ['l', 'C', '6183', 'd', '6519', 'm']
[EX A]: 12702

[EX Q]: 3, 4, ['F', '7341', 'P', '3315']
[EX A]: 3315

[EX Q]: 2, 11, ['8593', '7085', '3875', 'A', '7161', 'K', 'C', 'E', 'l', '2923', '8831', 'V', '1923', 'K', 'A']
[EX A]:
29875