I encountered a problem while finding the no. of ways of selecting any unordered set from n unique elements that should not have m pairs.
1<=cardinality(set)<=n
pairs are defined as unordered sets of 2 from those n unique elements.
m pairs are given already.