Duckwise Northward

Duckwise Northward is hard. User: A() made it to be hard to program in, so every command must be used once and if you run out of commands they reset and you can use them again.

Commands

Caption text

BF	Command	Explanation
[.-]	(	Repeatedly output and decrement until the current cell equals zero.
[+	)	Start a loop if the current cell isn't zero, incrementing if true.
.]	^	Print the current cell, then jump to the start of the loop if the current cell isn't zero.
]+[	v	Jump to the start of the loop if the current cell isn't zero, otherwise increment the current cell and start a new loop.
,.	%	Store input in the current cell, then immediately print it.
]-[	_	Jump to the start of the loop if the current cell isn't zero, otherwise decrement the current cell and start a new loop.
++++	#	Increment the current cell by four.
---	?	Decrement the current cell by three.
>[	k	Move the pointer to the next cell, then start a loop if the current cell isn't zero.
]<	c	Jump to the start of the loop if the current cell isn't zero, otherwise move the pointer to the previous cell.
,-	!	Store input in the current cell, then decrement that value.
>+	@	Move the pointer to the next cell, incrementing it.
+<	$	Increment the current cell, then move the pointer to the previous one.
[>	~	Start a loop if the current cell isn't zero, moving the pointer to the next cell if true.
]>	/	Jump to the start of the loop if the current cell isn't zero, otherwise move the pointer to the next cell.
>>>	r	Move the pointer to the cell three slots over.
<<	l	Move the pointer to the cell two slots over.
>+<-	m	Increment the next cell, then decrement the current one.
[>[-]<+]	Q	Reset the current cell and the next one over unless the current cell is equal to zero.

Programs

Cat

#)%vrc

which translates to:

++++[+,.]+[>>>]<

A+B

!#?k^%c)(_

Print every ascii character lower than input

@%m(