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]: 9, 10, ['8997', 'P', '2065', 'F', '2531', 'o', 'a', '3057', '7393', '2665', '4563']
[EX A]: 10058

[EX Q]: 7, 19, ['6719', 'c', 'S', '3259', '1287', 'u', '9251', '2183', '4821', '9449', 'I', 'P', 'i', '7597', '8141', 'G', 'j', '8587', '7245', 'G', 'O', 'o', '9479']
[EX A]: 57274

[EX Q]: 6, 26, ['z', 'c', '2049', 't', '2187', 'r', 'z', 'd', 'D', '9773', 'E', '8521', '5327', '8889', 'd', '6301', 'T', 'M', '9101', 'r', '7449', 'X', '8675', '4755', '13', '8549', '2117']
[EX A]:
77353