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]: 4, 11, ['4679', 'V', '3421', '8995', '2885', '5395', 'E', '2169', 'i', 'B', '9279', 'G', 'N', 'I', 's', '6827', 'S']
[EX A]: 28723

[EX Q]: 2, 5, ['9615', '7859', 'D', 'J', '1471']
[EX A]: 9330

[EX Q]: 1, 7, ['2085', '5455', 'l', 't', 'D', 'X', '523']
[EX A]:
8063