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]: 11, 16, ['3847', '4705', '7023', '7353', '9569', '7437', 'G', '7437', 'O', '8789', 'k', 'r', '8083', '7213', '4027', '595', 'P', 'n', '1377', '3271', '6443', '3251', 'K', 'K']
[A]: 19918


[Q]: 2, 2, ['V', 'a']
[A]: 0


[Q]: 18, 20, ['837', 'Y', '3301', 'e', '4523', 'b', '3695', '1897', 'i', 'u', '837', '1941', '3949', '2923', '6791', '535', 'e', 'z', 'a', 's', '4281', '8701', '4565', '2819', '2371', '5063', 'f', 'y', '189']
[A]:
0