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.

[EX Q]: 3, 5, ['7639', '7477', '2545', '6847', 'N', 'H']
[EX A]: 9392

[EX Q]: 4, 7, ['7463', '6237', 'v', '9817', '969', '6317', 'N', 'k', '2023']
[EX A]: 17103

[EX Q]: 7, 8, ['Y', '4025', 'N', 'k', 'q', '901', 'Y', '2049', 'D', '3993', 'N', 'g', '7627', 'T', 'j', 'j']
[EX A]:
2049