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]: 2, 5, ['4487', '3761', '159', '7459', '6781', '2403', 'S', '3079', '7161']
[EX A]: 18160

[EX Q]: 1, 2, ['7321', '6233']
[EX A]: 13554

[EX Q]: 7, 19, ['7217', '3307', '6975', '7673', '8201', '5901', '633', 'g', '9173', '1135', '2659', 'r', 'Y', 'a', 'O', 'B', '7995', '9537', 'J', '4993', 'T']
[EX A]:
31132