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]: 7, 16, ['l', '1165', '8087', 'M', '6269', '6349', 'R', 'm', 'j', '9437', '3875', 'n', 'R', 'Y', '4427', 'g', '6231', 'm', '1139', '3891', '3773', '1303', 'Y', '7347']
[A]: 17739


[Q]: 3, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']
[A]: 45165


[Q]: 6, 8, ['1357', 'W', '5287', 'k', 'v', '6281', '4619', 'g', 'D']
[A]:
10900