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, 3, ['5437', '8521', '9081', 'h', '5453', '5065', '2949', 'P', 'Q', '2853', '7857', 'l', '5217', 'O', 'V', '3585', 't', '2593', 'V']
[EX A]: 23039

[EX Q]: 1, 6, ['B', 'N', 'b', '9383', '4711', 'K']
[EX A]: 14094

[EX Q]: 1, 4, ['a', 'r', '2475', 'K', 'm']
[EX A]:
2475