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]: 3, 4, ['v', 't', '4357', '1303']
[A]: 5660


[Q]: 1, 15, ['t', '77', '6593', '3683', '5673', '9391', 'Y', 'A', '3273', '379', '6569', 'l', 'u', '8633', 'M', '8587', '3127', '5885', '4083']
[A]: 44271


[Q]: 5, 8, ['d', 'f', '481', 'o', '5717', '7863', 'b', 'a', 't', '6425', 'b', '7297', '4477', 'G', '9803']
[A]:
13580