How do I write a program in Assembly Language that displays four tables n, 3n, 7n, Fn

************************************
***Welcome to the Program!***
************************************
n 3*n 7*n Fn
--- ----- ----- -----
0 0 0 0
1 3 7 1
2 6 14 1
3 9 21 2
4 12 28 3
... ... ... ...

and n needs to go all the way to 11 and so does the rest of the table. Fn is Fibonacci numbers that is F0=0, F1=1, and Fk = Fk-1 + Fk-2 for k>=2. The calculations must use previous results instead of just adding n+n+n+n so on and so forth. The program needs to be algorithmic on n. The only allowed check is to see if n exceeds 11. Do not use any variables at all.

I have no idea where to start, go from, or finish this thing, help on anything or even writing if for me would be greatly appreciated. Even if you don't write it for me maybe something similar to it that I can go off of. Thanks all