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]: 1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']
[EX A]: 0

[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]: 6, 16, ['4185', '9025', 'R', '4339', '2125', 'v', 'B', '3401', 'Y', '7173', 'Z', '1079', 'S', 'q', '7383', 'z', '4849', '5847', '3465', 'n', '6773', 'L']
[EX A]:
19036