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, 3, ['o', 'p', '4765', 'u', '629', 'p']
[A]: 4765


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


[Q]: 18, 20, ['w', '7021', 'Y', '1799', 'v', 'V', '9017', 'x', 'T', 'H', '2987', '2509', '623', 'k', 'n', 'y', 'j', '3825', '8871', 'i', '3965', 'e', 'S', 'R', 't', '723', 's', 'F', 'Z', '3093']
[A]:
12696