Let $$S=\{1,2,3,4,5,6\}$$. Then the number of one-one functions $$f: \mathrm{S} \rightarrow \mathrm{P}(\mathrm{S})$$, where $$\mathrm{P}(\mathrm{S})$$ denote the power set of $$\mathrm{S}$$, such that $$f(n) \subset f(\mathrm{~m})$$ where $$n < m$$ is ____________.

Suppose $$f$$ is a function satisfying $$f(x + y) = f(x) + f(y)$$ for all $$x,y \in N$$ and $$f(1) = {1 \over 5}$$. If $$\sum\limits_{n = 1}^m {{{f(n)} \over {n(n + 1)(n + 2)}} = {1 \over {12}}} $$, then $$m$$ is equal to __________.

For some a, b, c $$\in\mathbb{N}$$, let $$f(x) = ax - 3$$ and $$\mathrm{g(x)=x^b+c,x\in\mathbb{R}}$$. If $${(fog)^{ - 1}}(x) = {\left( {{{x - 7} \over 2}} \right)^{1/3}}$$, then $$(fog)(ac) + (gof)(b)$$ is equal to ____________.