#include #include #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; template inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template inline int ssize(const T &a) { return (int)std::size(a); } template std::istream &operator>>(std::istream &is, std::vector &a) { for (auto &x : a) is >> x; return is; } template std::ostream &operator<<(std::ostream &os, const std::pair &a) { return os << "(" << a.first << ", " << a.second << ")"; } template std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template struct is_iterable : std::false_type {}; template struct is_iterable())), decltype(std::end(std::declval()))>> : std::true_type {}; template ::value && !std::is_same::value && !std::is_same::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } #ifdef ENABLE_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #endif using namespace std; template struct Infinity { template constexpr operator T() const { static_assert(sign == 1 or not std::is_unsigned_v, "must be positive in an unsigned type"); if constexpr (std::numeric_limits::has_infinity) { return T(sign) * std::numeric_limits::infinity(); } else { return T(sign) * (std::numeric_limits::max() / T(2)); } } constexpr Infinity operator-() const { return {}; } template friend bool operator==(const T &x, const Infinity &y) { return x == T(y); } template friend bool operator!=(const T &x, const Infinity &y) { return x != T(y); } }; const Infinity<> INF; i64 solve() { int n, m; cin >> n >> m; vector A(n), B(m); cin >> A >> B; i64 ans = INF; REP(i, n) REP(j, m) { if (A[i] != B[j]) continue; vector xr = {i, j}; vector xm = {n, m}; auto [y, z] = atcoder::crt(xr, xm); if (y == 0 and z == 0) continue; chmin(ans, y); } if (ans == INF) { return -1; } return ans + 1; } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); cout << solve() << "\n"; }