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, 6, ['a', '9091', 'I', '4849', 'O', '2435', 'v']
[EX A]: 16375

[EX Q]: 2, 12, ['Y', '5063', 'S', 'u', 'k', 'i', '7319', '6513', '9547', '6537', 'h', '6079', '8767', '2057', '1063', 'l']
[EX A]: 41058

[EX Q]: 12, 17, ['N', 'o', '287', '3845', 'I', 'j', '2889', 'z', '8499', 'R', '9927', '489', '5821', '9057', '8983', '2327', '5559', '7837', 'b']
[EX A]:
32236