M Int Le (a<=b)

a <= b is the inclusive version of the pack's a < b, and that single word - inclusive - is why this node exists. M Int Le returns 1 if a is less than or equal to b, 0 otherwise, as a plain INT named a_le_b. It's the boundary-checking node: the one you reach for when "at the limit" should count as passing.

The inclusive boundary matters in the patterns that actually recur:

• Loop termination. "Run while frame <= last_frame" includes the final frame; using strict < would drop it. For a 25-step animation, <= 24 runs all 25 frames and <= 25 runs one extra - knowing which you want is the whole job.
• Budget checks. "Is steps so far still at or under the cap?" - at exactly the cap, the answer should be yes, you can still run this step.
• Range membership. Combined with a < node, a_le_b and a_gt_c together carve out "inside this range, endpoints included."

Same family rules as the rest: exact integer comparison, both inputs signed 32-bit INT defaulting to 0, output is a numeric 1/0 that multiplies into gates and feeds switch selectors. There's no separate "greater-or-equal" node - swap the operands and a_le_b becomes b >= a. The design is a small set of combinable primitives, and the off-by-one decision between < and <= is deliberately left to you, where it belongs.

It ships in ComfyUiNodes (repo Madlumi/ComfyUiNodes, author "Madanie"), a small personal pack of integer math, string helpers, and workflow-glue nodes. Install via ComfyUI Manager - search "ComfyUiNodes" - or:

cd ComfyUI/custom_nodes
git clone https://github.com/Madlumi/ComfyUiNodes

Then restart ComfyUI. No pip requirements or model downloads. Find it under Add Node → mnodes → int.

If this all sounds like the strict version's twin - it is, literally a one-operator difference in the source. Keep both in your mental toolkit and pick by whether the boundary is included.