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, 12, ['E', '6343', 'f', '541', '7361', '9993', 'g', '3185', 's', 'w', 'Q', 'I', 'e', 's']
[EX A]: 21080

[EX Q]: 8, 14, ['5097', '7621', '6965', '2047', '7871', '6725', '4123', 'U', 'T', 'm', 'E', 'x', '4295', 'Z', '4377', '1399', '3975', '5577', 'I', 'V', 'G', '2853', '4465', '2387', '2145', '4547']
[EX A]:
4295