#include #include using namespace std;int n,v[60],m[60],sum,dp[250010];int main(){ while(cin >> n) { if(n<0)break; sum = 0; for(int i=0;i<n;i++) {

#include using namespace std;int num_1,num_2,num_5,c1[8010],c2[8010];int main(){ while(cin >> num_1 >> num_2 >> num_5) { if(num_1==0&&num_2==0&&num_5==0)break; for(int i=0

#include #include using namespace std;int catalan[19]={ 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 47763

#include #include using namespace std;int main(){ int m,n,a[1010]; while(cin >> n >> m) { for(int i=0;i<n;i++)a[i]=i+1; for(int i=0;i<m-1;i++)next_permutation(a,a+n);

#include using namespace std;long long p;int a[100010];int main(){ while(cin >> p) { if(p==0)break; if(p==2)cout << "Impossible" << endl; else {