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, 5, ['O', '4521', 'w', '6745', 'W', '7743', '4113', '7179', '9751', '2365', '9161', 'j', '1339', '6927']
[EX A]: 11266

[EX Q]: 3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']
[EX A]: 4477

[EX Q]: 14, 30, ['j', 'g', 'b', '3597', 'i', '3395', '7621', 'f', '5021', 'i', '8465', '2719', '4859', '9161', 'h', 'P', 'i', 'K', '6625', 'n', 'c', '9245', '8789', 'N', 'I', '3861', 'w', '9945', '7537', 'g']
[EX A]:
55163