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]: 5, 6, ['M', '4965', '7693', 'g', 'G', '695', '2401', '5715', 'P', '8197']
[A]: 695


[Q]: 16, 23, ['g', 'p', '7457', 'l', 'a', 'a', 'C', '6307', 'G', '5453', '1165', 'W', '6419', 's', '9445', 'y', 'Y', 'F', '9703', '4049', 'Y', '7173', 's', '7925', 'Z', '4413', 'd', '649']
[A]: 20925


[Q]: 26, 29, ['x', '2787', '8571', '7767', 'j', '5555', '1131', 'A', '7647', '4833', '5235', '5307', 'j', 'C', '9545', 'q', '5627', '8867', 'h', 'r', '9979', '387', '7343', 'r', 'b', 'I', '4731', 'm', 'Q']
[A]:
4731