#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T1,typename T2,typename T3>istream &operator>>(istream &is,tuple<T1,T2,T3>&a){is>>std::get<0>(a)>>std::get<1>(a)>>std::get<2>(a);return is;}
template<typename T,size_t n>istream &operator>>(istream &is,array<T,n>&a){for(auto&i:a)is>>i;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define overload3(_1,_2,_3,name,...) name
#define rep1(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define reps(i,l,r) rep2(i,l,r)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<(x)<<'\n',static_cast<void>(0)
#define yn(x) cout<<((x)?"Yes\n":"No\n")
#define uniq(x) sort(all(x)),x.erase(unique(all(x)),x.end())
template<typename T>
inline int fkey(vector<T>&z,T key){return lower_bound(z.begin(),z.end(),key)-z.begin();}
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
#ifdef LOCAL
#include<debug.h>
#define SWITCH(a,b) (a)
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define SWITCH(a,b) (b)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
struct Timer{
  clock_t start;
  Timer(){
    start=clock();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout<<fixed<<setprecision(16);
  }
  inline double now(){return (double)(clock()-start)/1000;}
  #ifdef LOCAL
  ~Timer(){
    cerr<<"time:";
    cerr<<now();
    cerr<<"ms\n";
  }
  #endif
}timer;
void SOLVE();
int main(){
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
}
#include<concepts>
template<typename T,int N,int M=N>
struct ConstantMatrix{
private:
  std::array<std::array<T,M>,N>dat;
public:
  ConstantMatrix(){
    dat.fill([](){std::array<T,M>res;res.fill(T());return res;}());
  }
  static ConstantMatrix E(){
    static_assert(N==M);
    ConstantMatrix res;
    for(int i=0;i<N;i++)res[i][i]=T(1);
    return res;
  }
  inline  ConstantMatrix &operator+=(const ConstantMatrix&rhs){
    for(int i=0;i<N;i++)for(int j=0;j<M;j++)(*this)[i][j]+=rhs[i][j];
    return *this;
  }
  inline ConstantMatrix &operator-=(const ConstantMatrix&rhs){
    for(int i=0;i<N;i++)for(int j=0;j<M;j++)(*this)[i][j]-=rhs[i][j];
    return *this;
  }
  inline ConstantMatrix &operator*=(const ConstantMatrix&rhs){
    static_assert(N==M);
    ConstantMatrix res;
    for(int i=0;i<N;i++)for(int j=0;j<M;j++)for(int k=0;k<M;k++)res[i][k]+=(*this)[i][j]*rhs[j][k];
    (*this)=std::move(res);
    return *this;
  }
  friend ConstantMatrix operator+(const ConstantMatrix&lhs,const ConstantMatrix&rhs){return ConstantMatrix(lhs)+=rhs;}
  friend ConstantMatrix operator-(const ConstantMatrix&lhs,const ConstantMatrix&rhs){return ConstantMatrix(lhs)-=rhs;}
  template<int K>friend ConstantMatrix<T,N,K> operator*(const ConstantMatrix&lhs,const ConstantMatrix<T,M,K>&rhs){
    ConstantMatrix<T,N,K>res;
    for(int i=0;i<N;i++)for(int j=0;j<M;j++)for(int k=0;k<K;k++)res[i][k]+=lhs[i][j]*rhs[j][k];
    return res;
  }
  std::array<T,M> &operator[](int i){return dat[i];}
  const std::array<T,M> &operator[](int i)const{return dat[i];}
  friend bool operator==(const ConstantMatrix&lhs,const ConstantMatrix&rhs){
    for(int i=0;i<N;i++)for(int j=0;j<M;j++)if(lhs[i][j]!=rhs[i][j])return false;
    return true;
  }
  friend bool operator!=(const ConstantMatrix&lhs,const ConstantMatrix&rhs){
    for(int i=0;i<N;i++)for(int j=0;j<M;j++)if(lhs[i][j]!=rhs[i][j])return true;
    return false;
  }
  T det()const{
    static_assert(N==M);
    T res=1;
    ConstantMatrix mat(*this);
    for(int i=0;i<M;i++){
      int idx=-1;
      for(int j=i;j<N;j++)if(mat[j][i]!=T()){
        idx=j;
        break;
      }
      if(idx==-1)return T();
      if(i!=idx)std::swap(mat[i],mat[idx]),res=-res;
      res*=mat[i][i];
      T inv_ii=mat[i][i].inv();
      for(int j=i+1;j<M;j++)mat[i][j]*=inv_ii;
      for(int j=i+1;j<N;j++){
        T coef=-mat[j][i];
        for(int k=i+1;k<M;k++)mat[j][k]+=coef*mat[i][k];
      }
    }
    return res;
  }
  ConstantMatrix inv()const{
    static_assert(N==M);
    ConstantMatrix res=E(),mat=(*this);
    for(int i=0;i<N;i++){
      int id=-1;
      for(int j=i;j<N;j++)if(mat[j][i]!=T()){
        id=j;
        break;
      }
      if(id==-1)return ConstantMatrix();
      if(i!=id){
        std::swap(mat[i],mat[id]);
        std::swap(res[i],res[id]);
      }
      T inv=mat[i][i].inv();
      for(int j=0;j<N;j++)if(i!=j){
        T x=mat[j][i];
        for(int k=0;k<N;k++){
          mat[j][k]-=mat[i][k]*x;
          res[j][k]-=res[i][k]*x;
        }
      }
    }
    return res;
  }
  template<std::integral U>
  ConstantMatrix pow(U k)const{
    static_assert(N==M);
    ConstantMatrix res=ConstantMatrix::E(),a(*this);
    while(k){
      if(k&1)res*=a;
      a*=a;
      k>>=1;
    }
    return res;
  }
  std::vector<std::vector<T>>to_vector()const{
    std::vector<std::vector<T>>res(N,std::vector<T>(M));
    for(int i=0;i<N;i++)for(int j=0;j<M;j++)res[i][j]=dat[i][j];
    return res;
  }
  friend std::istream &operator>>(std::istream&is,ConstantMatrix&rhs){
    for(int i=0;i<N;i++)for(int j=0;j<M;j++)is>>rhs[i][j];
    return is;
  }
  friend std::ostream &operator<<(std::ostream &os,const ConstantMatrix&rhs){
    for(int i=0;i<N;i++){
      for(int j=0;j<M;j++)os<<rhs[i][j]<<" \n"[j+1==M];
    }
    return os;
  }
};
void SOLVE(){
  ConstantMatrix<ll,2>M,M2;
  cin>>M>>M2;
  auto ans=M*M2*M*M2;
  rep(i,2)rep(j,2)cout<<ans[i][j]<<" \n"[j==1];
}