#include <iostream>

using namespace std;
int maxn=1000;
struct Bint {
    int m[maxn];

    Bint operator + (Bint k) {
        int ans[maxn+2];
    for (int i=0;i<maxn;i++) { if (k.m[i]+m[i]<10) ans[i]+=k.m[i]+m[i]; else { ans[i]+=k.m[i]+m[i]-10; ans[i+1]+=1; }
    ans[i+1]+=ans[i]/10;
    ans[i]%=10;
    }
    Bint qq;
    for (int i=0;i<maxn+1;i++) qq.m[i]=ans[i];
    return qq;
};

Bint operator * (Bint k) {
    int ans[maxn];
    for (int i=0;i<maxn/2;i++) {
        for (int j=0;j<maxn/2;j++) {
            ans[i+j]+=m[i]*k.m[j];
        }
    }
    for (int i=0;i<maxn-1;i++) { ans[i+1]+=ans[i]/10; ans[i]%=10; }
    Bint qq;
    for (int i=0;i<maxn;i++) qq.m[i]=ans[i];
    return qq;
};


};
int main() {
    Bint a;
    Bint b;
    a.m[0]=1;
    b.m[0]=2;
    Bint c=a*b;
    for (int i=0;i<10;i++) cout<<c.m[i]<<" ";
    return 0;
}