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.

Example input: 3, 7, ['A', '23', '7413', '6933', '3369', '807', 'M', '456']
Example output: 18522
Example explanation: Here, the numbers from 3rd to 7th position are '7413', '6933', '3369', and '807', hence their sum (7413+6933+3369+807) is 18522.
Q: 22, 23, ['P', 'b', 'o', '5855', 'G', '5187', 't', 'F', '1065', 'R', 'y', '8101', '9647', 'u', '2611', '5981', 'l', '9595', '6349', '9849', 'v', '3567', 'w', '945', '4173', '3231', 'F', '5311', 'p', 'h']
A:
3567