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]: 2, 5, ['W', 'A', 'm', 'w', 'r', '9705', '1729', 'U', '2171', 'Q', 'Y', 'P', 'O']
[EX A]: 0

[EX Q]: 2, 3, ['u', '7053', '303', '329', 'D']
[EX A]: 7356

[EX Q]: 19, 22, ['M', 'o', 'f', '5573', 'z', '9067', 'F', '7657', 'v', '83', '4447', 'X', '921', 'w', 'T', '31', '4153', 'A', '7153', '3369', '5447', 'u', '4319']
[EX A]:
15969