Scheme/DrRacket

How do I write a function that takes any integers in a list and produces the number of values in the list whose one's digit (i.e. the least significant or rightmost digit) is 1. For example,
(ones (list 82 231 1 22 1000)) => 2?

TRUE := λx.λy.x
FALSE := λx.λy.y
AND := λp.λq.p q p
IF := λp.λa.λb.p a b
CONS := λx.λy.λf.f x y
CAR := λp.p TRUE
CDR := λp.p FALSE
NIL := λx.TRUE
NULL := λp.p (λx.λy.FALSE)
0 := λf.λx.x
SUCC := λn.λf.λx.f (n f x)
1 := SUCC 0
10 := λf.λx.f (f (f (f (f (f (f (f (f (f x)))))))))
PRED := λn.λf.λx.n (λg.λh.h (g f)) (λu.x) (λu.u)
SUB := λm.λn.n PRED m
ISZERO := λn.n (λx.FALSE) TRUE
LEQ := λm.λn.ISZERO (SUB m n)
EQ := λm.λn.AND (LEQ m n) (LEQ n m)
Y := λg.(λx.g (x x)) (λx.g (x x))
MOD10 := Y (λr.λx.IF (LEQ 10 x) (r (SUB x 10)) x)
COUNT := Y (λr.λf.λx. (IF (NULL x) 0 ((IF (f (CAR x)) SUCC 1) (r (CDR x)))))
COUNT-ONE-DIGITS := COUNT (λx.EQ (MOD10 x) 1)

Expanded:

COUNT-ONE-DIGITS := ((λg.(λx.g (x x)) (λx.g (x x))) (λr.λf.λx. ((λp.λa.λb.p a b) ((λp.p (λx.λy.(λx.λy.y))) x) (λf.λx.x) (((λp.λa.λb.p a b) (f ((λp.p (λx.λy.x)) x)) (λn.λf.λx.f (n f x)) (λf.λx.f x)) (r ((λp.p (λx.λy.y)) x)))))) (λx.(λm.λn.(λp.λq.p q p) ((λm.λn.(λn.n (λx.(λx.λy.y)) (λx.λy.x)) ((λm.λn.n (λn.λf.λx.n (λg.λh.h (g f)) (λu.x) (λu.u)) m) m n)) m n) ((λm.λn.(λn.n (λx.(λx.λy.y)) (λx.λy.x)) ((λm.λn.n (λn.λf.λx.n (λg.λh.h (g f)) (λu.x) (λu.u)) m) m n)) n m)) (((λg.(λx.g (x x)) (λx.g (x x))) (λr.λx.(λp.λa.λb.p a b) ((λm.λn.(λn.n (λx.(λx.λy.y)) (λx.λy.x)) ((λm.λn.n (λn.λf.λx.n (λg.λh.h (g f)) (λu.x) (λu.u)) m) m n)) (λf.λx.f (f (f (f (f (f (f (f (f (f x)))))))))) x) (r ((λm.λn.n (λn.λf.λx.n (λg.λh.h (g f)) (λu.x) (λu.u)) m) x (λf.λx.f (f (f (f (f (f (f (f (f (f x)))))))))))) x)) x) (λf.λx.f x))