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, 4, ['L', '8053', '8121', 'J', 'H', '7591', 'U', 'm']
[A]: 16174


[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]: 4, 7, ['o', '2933', '1565', 'D', 'H', '4421', '4979', '8697', 'A']
[A]:
9400