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]: 3, 4, ['F', '7341', 'P', '3315']
[A]: 3315


[Q]: 10, 14, ['u', 'o', 'V', '8223', '365', 'u', '8971', '4209', 'E', 'I', '3385', '5521', '1329', 'b', 'C', '5707', '1807', '2859', '7443', '8141', 'u', '6269', '5781', 'T', 'N', 'R', 'C']
[A]: 10235


[Q]: 10, 12, ['4185', 'J', 'r', 'Z', '779', 'g', 'P', '4631', '9115', '4285', 'n', 'k', '9665']
[A]:
4285