#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

void solve() {
  int p, q;
  scan(p, q);

  if (q * 4 < p * 5) {
    print(-1, -1);
  }

  if (p * 3 <= q * 2) {
    string s(q * 2, '.');
    for (int i : rep(p)) {
      s[i * 3] = '#';
      s[i * 3 + 1] = '#';
    }
    print(1, q * 2);
    print(s);
  }

  if (p == 3 && q == 4) {
    print(8, 8);
    print("..######");
    print("###..###");
    print("######..");
    print("#..#####");
    print("####..##");
    print(".######.");
    print("##..####");
    print("#####..#");
  }

  if (p == 4 && q == 5) {
    print(5, 5);
    print(".####");
    print("##.##");
    print("####.");
    print("#.###");
    print("###.#");
  }

  if (p == 5 && q == 7) {
    print(14, 14);
    int i = 0;
    do {
      string s(14, '#');
      for (int j : rep(i, i + 4)) {
        s[j % 14] = '.';
      }
      print(s);
      i += 5;
      i %= 14;
    } while (i);
  }

  if (p == 7 && q == 9) {
    print(18, 6);
    print("..####");
    print("####.#");
    print("##.###");
    print(".####.");
    print("###.##");
    print("#.####");
    print("####..");
    print("##.###");
    print(".#####");
    print("###..#");
    print("#.####");
    print("#####.");
    print("##..##");
    print(".#####");
    print("####.#");
    print("#..###");
    print("#####.");
    print("###.##");
  }

  if (p == 7 && q == 10) {
    print(20, 20);
    int i = 0;
    do {
      string s(20, '#');
      for (int j : rep(i, i + 6)) {
        s[j % 20] = '.';
      }
      print(s);
      i += 7;
      i %= 20;
    } while (i);
  }
}

}  // namespace

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  solve();
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

using namespace std;

namespace std {

template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts...>& t) {
  return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

template <class R, enable_if_t<!is_convertible_v<R, string>>* = nullptr>
auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << ' ' << p.second;
}

template <class... Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
  auto f = [&os](const auto&... xs) -> ostream& {
    [[maybe_unused]] auto sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

template <class R, enable_if_t<!is_convertible_v<R, string_view>>* = nullptr>
auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

}  // namespace std

template <class... Ts>
void scan(Ts&&... xs) {
  (cin >> ... >> xs);
}

template <class... Ts>
void print(Ts&&... xs) {
  cout << tie(xs...) << '\n';
}

inline auto rep(int l, int r) { return views::iota(min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }
inline auto per(int l, int r) { return rep(l, r) | views::reverse; }
inline auto per(int n) { return per(0, n); }
inline auto per1(int l, int r) { return per(l, r + 1); }
inline auto per1(int n) { return per(1, n + 1); }

inline auto len = ranges::ssize;

#endif  // __INCLUDE_LEVEL__