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]: 5, 6, ['x', 't', '9767', '4787', 'T', 'e', 'Y', '8919']
[A]: 0


[Q]: 3, 5, ['a', 'q', 'a', '4295', 'z', '675', '3975', 'P', 'e', '4231', '2547', 'V', 'S', '5285', 'Y', 'J']
[A]: 4295


[Q]: 1, 17, ['W', 'd', 'Z', 'Q', 'l', 'T', 'J', 'A', 'q', '6467', 'I', '4633', 'Q', '2889', 'h', 's', '2463', 'N', 'L', '8009', 't']
[A]:
16452