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.

[Q]: 2, 11, ['N', '3963', 'O', 'T', '8551', '3099', '577', '9273', '9849', '2593', '4693', 'A', 'O', '7381', 'o', 'P', 'g', 'H', '3927']
[A]: 42598


[Q]: 12, 15, ['I', 'H', '3483', '6289', 'X', '5705', '7707', 'x', 'J', 'c', '5161', '9653', '3949', 'l', 'b', 'C', 's', '17', 'a', '4231', 't']
[A]: 13602


[Q]: 6, 8, ['4825', 'L', 'M', '2839', '2287', 'y', '3791', '5855', 'o', 'R', 'Y', 'y', 'K', 'E', 'R', 'a', 'v', 'E', '209', '8821', '5741']
[A]:
9646