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]: 7, 9, ['6409', '7805', '2757', 'A', '8949', '449', 'N', 'M', '9511', 'v', '6085', '1101', '4995', 'B', '6039', '295', '5459', '4211', 't', '3415']
[EX A]: 9511

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

[EX Q]: 3, 9, ['6771', 's', '7673', '6331', '7295', 'G', 't', '6049', 'R']
[EX A]:
27348