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, 15, ['8815', 'w', '5613', 'm', '9515', '9741', 'O', 'U', '7197', '5237', 'M', '9899', '8289', 'l', '3', '9313', '4467', 'K', 'k', '637']
[EX A]: 55494

[EX Q]: 7, 17, ['n', '1023', '2743', 'r', '5855', 'd', '4425', '3381', 'x', '9609', 'f', 'o', '8513', 'e', '7331', 'N', '7949', 'O']
[EX A]: 41208

[EX Q]: 7, 7, ['y', '2785', 'J', '8509', '855', '995', '6205', '7663', '5573', '4143', 'm', 'Y', '6003', 't', 'I', 'b']
[EX A]:
6205