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]: 1, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']
[EX A]: 23119

[EX Q]: 3, 5, ['b', 'a', 't', 'l', '8337', 'L', '913', 'O', '1009', '3615', 'u', 'E', 'Y', 'h', '51', '1673']
[EX A]: 8337

[EX Q]: 2, 27, ['o', '871', '9603', 'D', 'b', 'z', 'I', 'y', '1323', 's', 'l', 'W', 'I', '8725', 'Z', '5419', 'X', 'a', '625', 'M', '4397', 'R', '8395', '8649', '9539', '6813', 'Q', 'g', 'z']
[EX A]:
64359