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]: 13, 14, ['5297', 'V', '7495', '6967', 'b', 'w', 'a', '2403', 'V', 'n', '525', 'd', 'o', 'm', '3439', '4245', '6381', '5743', 'P', '1047']
[A]: 0


[Q]: 3, 6, ['7073', '3047', 'O', 'c', 'u', 'G']
[A]: 0


[Q]: 3, 20, ['125', 'u', 'o', 'g', 'O', 'Z', '8853', '4709', 'Z', '2627', '7919', '195', '7627', 'f', '395', '9811', '7781', 'P', 'l', '4157']
[A]:
54074