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.

[Q]: 10, 13, ['z', 'h', '141', '7351', '3683', '2199', '1981', '107', 'Y', 'E', 'G', 'P', '9677', 'O', 'e', '1661', 'f', '1367', 'b', '8531']
[A]: 9677


[Q]: 6, 8, ['t', 'N', 'r', '2281', 'u', 'q', 'f', 'F', 'x', '4841', '4601', '8029', 'x', 'Q', 'M', 'L', '5975', 'v', '2913', 'S', 'M', '6429', '4499']
[A]: 0


[Q]: 21, 27, ['8879', '8245', 'i', 'Q', 'k', 'y', 'e', '1631', '7905', '6025', 'R', 'x', '9991', 'g', 'z', 'd', '2825', 'w', 'H', '5435', 'j', '3211', '7751', '6339', '1965', '7421', 'y', '9201', '8207', '2085']
[A]:
26687