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]: 8, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']
[A]: 203


[Q]: 7, 18, ['279', 'o', '8421', 'e', '2167', '6647', 'i', 's', 'I', 'G', '8201', 'E', 'h', 'U', '403', 'c', 'u', 'B', '9415', 't', 'a', '8787', 'E', '9677']
[A]: 8604


[Q]: 1, 2, ['7625', '9677', '2077']
[A]:
17302