10 2 5
1 1 1 2 2 2 2 2 2 2
 10 2 5
1 1 1 1 1 1 2 2 2 2
 3 3 2
1 3 1
 8 8 7
7 2 8 6 8 5 3 8
 7 7 5
2 6 3 6 3 5 1
 5 5 1
5 2 5 1 2
 6 6 6
5 6 5 3 4 2
 5 5 2
2 3 2 2 4
 3 3 3
1 1 1
 111 78 54
24 13 49 22 52 38 38 63 21 10 9 56 60 47 11 78 23 52 55 12 72 33 17 14 33 59 21 32 20 73 1 60 27 64 23 74 36 49 69 14 29 37 19 61 52 33 26 27 10 11 34 25 62 47 36 12 63 45 31 71 78 1 6 26 36 65 56 46 19 28 77 64 56 8 77 38 3 33 63 77 40 7 22 13 60 14 57 43 51 10 30 21 7 67 32 11 12 9 72 24 27 67 25 63 6 67 69 37 26 19 26
 10 2 5
1 1 1 1 1 1 1 1 1 2
 6 6 1
4 5 6 3 5 3
 10 2 5
1 1 1 1 2 2 2 2 2 2
 8 8 3
8 8 2 7 8 2 3 5
 7 7 4
4 6 6 7 2 5 3
 10 2 5
2 2 2 2 2 2 2 2 2 2
 111 67 97
32 67 4 15 17 17 23 6 39 54 19 62 28 59 63 36 44 40 28 67 28 3 55 19 11 26 3 38 22 26 62 54 61 15 22 4 47 53 27 36 31 5 16 59 51 62 51 46 7 55 26 66 50 51 32 17 54 14 18 14 40 30 24 2 61 16 16 27 55 58 35 7 26 3 26 4 13 59 14 32 56 54 5 46 39 30 45 24 37 12 67 38 45 32 41 21 46 26 41 29 15 28 65 5 19 53 13 31 58 18 57
 6 6 2
4 4 2 4 2 3
 10 2 5
1 1 1 1 1 2 2 2 2 2
 10 2 5
1 1 1 1 1 1 1 1 2 2
 6 6 4
5 2 4 3 1 5
 10 2 5
1 1 2 2 2 2 2 2 2 2
 1 1 1
1
 8 8 5
7 5 6 8 2 8 3 4
 10 2 5
1 1 1 1 1 1 1 2 2 2
 111 101 52
54 69 33 81 8 90 48 21 96 35 44 75 68 34 101 82 93 94 86 76 33 91 5 70 22 84 70 71 62 81 50 83 51 43 95 46 19 53 101 34 51 40 6 17 69 60 73 89 65 75 59 68 62 49 89 23 63 83 86 68 62 39 1 18 3 75 44 57 9 24 67 81 83 45 93 66 79 71 43 49 17 2 33 38 98 71 71 21 56 16 31 2 75 61 64 38 69 80 81 12 68 95 26 9 69 82 41 35 75 7 71
 3 3 3
3 3 1
 4 4 2
2 4 4 3
 10 2 5
1 2 2 2 2 2 2 2 2 2
 4 4 4
4 4 4 4
 3 3 2
1 2 3
 2 1 2
1 1
 5 5 3
3 4 1 5 5
 7 7 1
2 6 5 6 2 3 3
 111 9 57
9 9 2 6 8 6 5 8 9 7 3 9 1 2 6 6 5 3 1 1 6 1 8 4 3 9 8 6 8 1 9 8 5 8 6 9 4 5 7 3 1 6 4 3 2 5 7 3 1 7 9 1 7 1 3 5 9 5 6 2 2 7 9 7 1 5 5 5 5 2 6 5 7 3 8 9 7 3 6 5 1 9 2 9 9 8 8 7 9 1 6 2 4 5 7 4 8 9 9 2 7 7 6 9 8 2 1 3 3 1 5
 4 4 1
2 4 1 4
 2 1 1
1 1
 111 16 58
15 6 4 7 7 10 16 2 3 1 4 8 10 1 2 11 6 6 14 16 6 16 1 2 13 2 7 13 1 4 1 4 12 2 4 11 15 12 9 13 10 4 11 7 5 3 12 11 11 3 16 15 9 6 15 11 4 14 8 15 16 3 9 10 9 1 8 4 14 7 13 5 1 8 5 11 8 14 1 8 15 2 5 2 4 5 9 2 10 11 11 5 7 11 11 14 5 16 14 2 4 11 12 10 7 14 2 5 3 2 1
 2 2 2
1 1

4
 5
 2
 6
 12
 3
 1
 4
 1
 648
 2
 4
 5
 19
 25
 1
 214
 5
 6
 3
 11
 3
 1
 41
 4
 881
 1
 4
 2
 1
 3
 1
 7
 4
 446
 3
 1
 552
 1

#include <bits/stdc++.h>
using namespace std;
struct FFT {
  const static int max_power_of_2 = 19;
  const static int max_polynomial_sz = (1 << max_power_of_2);
  bool done_precalculation = false;
  template <class base, class T>
  inline bool instanceof (const T, const base) {
    return is_base_of<base, T>::value;
  }
  struct Parent {
  } parentClass;
  template <class T>
  struct cd : Parent {
    T x, y;
    template <class Q>
    cd(Q a) {
      (*this) = a;
    }
    cd(T a, T b) {
      x = a;
      y = b;
    }
    cd(T a) {
      x = a;
      y = T();
    }
    cd() {
      x = T();
      y = T();
    }
    inline void real(T a) { x = a; }
    inline void imag(T a) { y = a; }
    inline T real() { return x; }
    inline T imag() { return y; }
    template <typename Q>
    inline void operator=(const Q &b) {
      x = b.x;
      y = b.y;
    }
    template <typename Q>
    inline void operator*=(const Q &b) {
      T pom = x;
      x = x * b.x - y * b.y;
      y = pom * b.y + y * b.x;
    }
    template <typename Q>
    inline cd operator*(const Q &b) {
      return cd(x * b.x - y * b.y, x * b.y + y * b.x);
    }
    inline void operator/=(const double &b) {
      x /= b;
      y /= b;
    }
    inline cd operator/(double b) { return cd(x / b, y / b); }
    template <typename Q>
    inline void operator-=(const Q &b) {
      x -= b.x;
      y -= b.y;
    }
    template <typename Q>
    inline cd operator-(const Q &b) {
      return cd(x - b.x, y - b.y);
    }
    template <typename Q>
    inline void operator+=(const Q &b) {
      x += b.x;
      y += b.y;
    }
    template <typename Q>
    inline cd operator+(const Q &b) {
      return cd(x + b.x, y + b.y);
    }
    template <typename Q>
    inline cd operator%(const Q &b) {
      return cd(x % b, y % b);
    }
    template <typename Q>
    inline void operator%=(const Q &b) {
      x %= b;
      y %= b;
    }
    inline void operator*=(const cd<double> &b) {
      T pom = x;
      x = x * b.x - y * b.y;
      y = pom * b.y + y * b.x;
    }
    inline cd operator*(const cd<double> &b) {
      return cd(x * b.x - y * b.y, x * b.y + y * b.x);
    }
    inline void operator*=(const double &b) {
      T pom = x;
      x = x * b - y * b;
      y = pom * b + y * b;
    }
    inline cd operator*(const double &b) {
      return cd(x * b - y * b, x * b + y * b);
    }
    inline cd conj() { return cd(x, -y); }
  };
  template <typename T>
  inline T round(T t) {
    t.x = round(t.x);
    t.y = round(t.y);
    return t;
  }
  static cd<double> prekw[max_polynomial_sz + 10];
  const double PI = acos(-1);
  void prek_w() {
    for (int i = 0; i < max_polynomial_sz; i++) {
      double angle = 2 * PI * i / max_polynomial_sz;
      cd<double> wlen(cos(angle), sin(angle));
      prekw[i] = wlen;
    }
  }
  template <class T>
  void fft(vector<T> &a, bool invert) {
    int n = a.size();
    for (int i = 1, j = 0; i < n; i++) {
      int bit = n >> 1;
      for (; bit & j; bit >>= 1) j ^= bit;
      j ^= bit;
      if (i < j) swap(a[i], a[j]);
    }
    for (int len = 2; len <= n; len <<= 1) {
      int hlen = len / 2;
      int angle = (max_polynomial_sz / len) * (invert ? -1 : 1);
      for (int i = 0; i < n; i += len) {
        int w = 0;
        for (int j = 0; j < hlen; j++) {
          T pom1 = a[i + j];
          T pom2 = a[i + j + hlen] * prekw[w];
          a[i + j] = pom1 + pom2;
          a[i + j + hlen] = pom1 - pom2;
          w += angle;
          if (w < 0) w += max_polynomial_sz;
        }
      }
    }
  }
  template <typename Q1, typename Q2, typename Q3>
  vector<Q1> mul(vector<Q1> &a, vector<Q1> &b, long long mod_selected,
                 bool round_selected) {
    if (!done_precalculation) prek_w();
    Q3 qtp3;
    if (instanceof (a[0], parentClass))
      qtp3 = cd<double>();
    else
      qtp3 = double();
    Q2 qtp2 = cd<Q3>();
    vector<Q2> fa;
    int n = 1;
    while (n < a.size() + b.size()) n <<= 1;
    fa.resize(n);
    for (int i = 0; i < n; i++) {
      fa[i].real((i < a.size()) ? a[i] : 0);
      fa[i].imag((i < b.size()) ? b[i] : 0);
    }
    vector<Q2> fa2(n);
    fft(fa, 0);
    Q2 pom1, pom2, A, B;
    for (int i = 0; i < n; i++) {
      pom1 = fa[i];
      pom2 = fa[(n - i) % n].conj();
      A = (pom1 + pom2) * cd<double>(0.5, 0) / n;
      B = (pom1 - pom2) * cd<double>(0, -0.5);
      fa2[i] = A * B;
    }
    fa = fa2;
    fft(fa, 1);
    vector<Q1> ret(n);
    for (int i = 0; i < n; i++) {
      if (round_selected) {
        Q3 rq = round(fa[i].real());
        if (mod_selected)
          ret[i] = rq % mod_selected;
        else
          ret[i] = rq;
      } else {
        Q3 rq = fa[i].real();
        if (mod_selected)
          ret[i] = rq % mod_selected;
        else
          ret[i] = rq;
      }
    }
    return ret;
  }
} fff;
int main() { return 0; }
