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]: 11, 14, ['7277', '3335', 'z', 'R', 's', '8267', 'q', '2743', 'w', '4003', 'G', 'O', 'Y', '4063', 'q', '7001', '7381', 'D', '6247', '7211', 'I', '2277', '7543', 'Y', '8243', '3127', 'V', '8709']
[EX A]: 4063

[EX Q]: 3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']
[EX A]: 4477

[EX Q]: 1, 2, ['7349', '1463']
[EX A]:
8812