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]: 6, 7, ['1595', '1523', '157', 'I', '3929', '6313', 'H', 'f', 'e', '93', '5625', 'b', 'J', 'b', '1185', '1505', 'I', 'y', '4043']
[EX A]: 6313

[EX Q]: 2, 7, ['1505', 'V', '4287', 'M', 'i', 'J', '9343', 'X', '2691', 'W', 'u', '7711', 'X', 'y', '9189']
[EX A]: 13630

[EX Q]: 16, 21, ['Z', '9525', '8929', 'h', '2875', '1147', '2417', 'a', '9225', 'f', 'Q', 't', 'k', '4447', '7863', '323', 'u', '5595', '7949', '5131', 's', '3943', 'z', '9739']
[EX A]:
18998