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]: 1, 6, ['u', 'L', 'm', '9283', 'e', '4615', '7815', '7185', 'h', 'h', '8985', '3987', '1521', 'k', '5715', 'd', 'w', 'T']
[A]: 13898


[Q]: 4, 16, ['3957', '489', 'E', '1005', '2759', 'v', '9169', '2143', '1019', '7041', '6981', 'y', 'R', 'C', 'H', 'E', 'f', 'H', '2877', '6813', 'B', 'Y', '499', 'Q', 't', '7039']
[A]:
30117