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]: 2, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']
[A]: 12269


[Q]: 16, 22, ['F', '197', '9799', 'W', '9967', 'V', '9955', '5143', 't', 'f', '749', 'N', 'b', '8049', 'W', '6835', '8007', 'm', '7233', 'B', 'I', '599', '6101', 'G', 'i', '2271', 'h', 'P']
[A]: 22674


[Q]: 2, 8, ['n', 'C', 'O', '5941', '6659', '953', '2721', 'o', 'n', '6099', 'T', '5125', '1519', '405']
[A]:
16274