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]: 10, 11, ['L', 'Z', '4501', '4131', 'a', '8057', 'K', 'P', '4713', '8889', 'b', '3927', 'k', '6005', 'T', 'w', 'S', '3963', '2727']
[EX A]: 8889

[EX Q]: 2, 6, ['S', 'y', '2729', '9935', 'T', 'H', '3063', '9587']
[EX A]: 12664

[EX Q]: 6, 7, ['7397', '5163', '2859', '7677', '9313', '7371', 'n', '547', '3785', '999', '2163', '4135', 'P']
[EX A]:
7371