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, 8, ['4225', 'k', '4097', '4459', '8125', '431', '495', 'Z']
[A]: 17607


[Q]: 1, 14, ['n', 'v', '7825', '5951', 'k', '1733', 'c', 'u', 'C', 'c', 'D', 'g', '9231', 'G']
[A]: 24740


[Q]: 4, 7, ['V', '113', '7087', '7861', '7447', 'E', '6519', '2617', '4193', 'q', '2681']
[A]:
21827