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, 17, ['T', 'j', '9425', '2255', '8915', '7957', 'U', '5987', '9461', 'A', 'g', 'n', 'F', '637', '475', 't', 'y']
[A]: 45112


[Q]: 1, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']
[A]: 4866


[Q]: 3, 3, ['o', '59', '9541', 'v', 'e', '7651', 'P', 'W', 'T', '3065', 'a', '5351', '7365', '9181', '9629']
[A]:
9541