Write a program or function that takes two numbers -
n>0 - as input, and finds all possible bases
b where the digit
3 appears at least
n times in
(x in base b).
Input and output may be through command line or function arguments, stdin/stdout, graphical input/output, error messages, function returns, etc.
The code must consist entirely of three-symbol "words", where each symbol is a letter or number (in printable ASCII) and the words are each separated by one non-alphanumeric printable ASCII character or newline (see example). Furthermore, adding a space into any of the words must ruin the program.
Shortest code wins.
The following code meets the first part of the specs (but doesn't actually work):
abc 123 fwe[3gY]4fs-es3=13N 338 w3W|W2w
5 1 ->
8 1 ->
23 1 ->
4 5 6 7 10 20
15 2 ->
111 2 ->
4 6 9 36
819 3 ->
A test program written in Java 8 can be found at http://pastebin.com/E8GpHbfB.