結果

問題 No.1172 Add Recursive Sequence
ユーザー kyon2326kyon2326
提出日時 2022-10-18 20:19:46
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 27,634 bytes
コンパイル時間 8,294 ms
コンパイル使用メモリ 358,864 KB
最終ジャッジ日時 2024-11-15 02:44:28
合計ジャッジ時間 9,429 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp:195:35: warning: 'template<class _Category, class _Tp, class _Distance, class _Pointer, class _Reference> struct std::iterator' is deprecated [-Wdeprecated-declarations]
  195 |         class zip_iterator : std::iterator<std::forward_iterator_tag, std::tuple<decltype(*std::declval<T>().begin())...>> {
      |                                   ^~~~~~~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:65,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/specfun.h:45,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/cmath:1935,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:41,
                 from main.cpp:5:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_iterator_base_types.h:127:34: note: declared here
  127 |     struct _GLIBCXX17_DEPRECATED iterator
      |                                  ^~~~~~~~
main.cpp: In instantiation of 'void p(const Head&, const Tail& ...) [with Head = modint_impl::static_modint_custom<1000000007>; Tail = {}]':
main.cpp:547:4:   required from here
main.cpp:157:102: error: no match for 'operator<<' (operand types are 'std::ostream' {aka 'std::basic_ostream<char>'} and 'const modint_impl::static_modint_custom<1000000007>')
  157 | template <typename Head, typename... Tail> void p(const Head& head, const Tail&... tail) { std::cout << head << (sizeof...(Tail) ? " " : ""); p(tail...); }
      |                                                                                            ~~~~~~~~~~^~~~~~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/istream:39,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/sstream:38,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/complex:45,
                 from

ソースコード

diff # 

#pragma GCC target("avx2")
#define _USE_MATH_DEFINES
#define _EXT_CODECVT_SPECIALIZATIONS_H 1
#define _EXT_ENC_FILEBUF_H 1
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
/*
#include <atcoder/all>
using namespace atcoder;
*/
/*
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<100>>;
using namespace boost::multiprecision;
*/
//#define int long long
using ll = long long;
constexpr ll MOD = (ll)1e9 + 7; //primitive root = 5
//constexpr ll MOD = 998244353; //primitive root = 3
//INT_MAX = (1<<31)-1 = 2147483647, INT64_MAX = (1LL<<63)-1 = 9223372036854775807
constexpr ll INF = std::numeric_limits<ll>::max() == INT_MAX ? (ll)1e9 + 7 : (ll)1e18;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, 0, -1};
constexpr ll dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr ll dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
#if defined(LOCAL_TEST) || defined(LOCAL_DEV)
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE 1
	#include <boost/stacktrace.hpp>
#endif
#ifdef LOCAL_TEST
	namespace std {
		template <typename T> class dvector : public std::vector<T> {
		public:
			using std::vector<T>::vector;
			template <typename T_ = T, typename std::enable_if_t<std::is_same_v<T_, bool>, std::nullptr_t> = nullptr>
			constexpr std::vector<bool>::reference operator[](std::size_t n) {
				if (this->size() <= n) { std::cerr << boost::stacktrace::stacktrace() << '\n' << "vector::_M_range_check: __n (which is " << n << ") >= this->size() (which is " << this->size() << ")" << '\n'; } return this->at(n);
			}
			template <typename T_ = T, typename std::enable_if_t<std::is_same_v<T_, bool>, std::nullptr_t> = nullptr>
			constexpr const T_ operator[](std::size_t n) const {
				if (this->size() <= n) { std::cerr << boost::stacktrace::stacktrace() << '\n' << "vector::_M_range_check: __n (which is " << n << ") >= this->size() (which is " << this->size() << ")" << '\n'; } return this->at(n);
			}
			template <typename T_ = T, typename std::enable_if_t<!std::is_same_v<T_, bool>, std::nullptr_t> = nullptr>
			constexpr T_& operator[](std::size_t n) {
				if (this->size() <= n) { std::cerr << boost::stacktrace::stacktrace() << '\n' << "vector::_M_range_check: __n (which is " << n << ") >= this->size() (which is " << this->size() << ")" << '\n'; } return this->at(n);
			}
			template <typename T_ = T, typename std::enable_if_t<!std::is_same_v<T_, bool>, std::nullptr_t> = nullptr>
			constexpr const T_& operator[](std::size_t n) const {
				if (this->size() <= n) { std::cerr << boost::stacktrace::stacktrace() << '\n' << "vector::_M_range_check: __n (which is " << n << ") >= this->size() (which is " << this->size() << ")" << '\n'; } return this->at(n);
			}
		};
		template <typename T, std::size_t N> class darray : public std::array<T, N> {
		public:
			using std::array<T, N>::array;
			constexpr darray(std::initializer_list<T> il) {
				*this = {}; int i = 0; for (auto&& x : il) this->operator[](i++) = x;
			}
			constexpr T& operator[](std::size_t n) {
				if (this->size() <= n) { std::cerr << boost::stacktrace::stacktrace() << '\n' << "vector::_M_range_check: __n (which is " << n << ") >= this->size() (which is " << this->size() << ")" << '\n'; } return this->at(n);
			}
			constexpr const T& operator[](std::size_t n) const {
				if (this->size() <= n) { std::cerr << boost::stacktrace::stacktrace() << '\n' << "vector::_M_range_check: __n (which is " << n << ") >= this->size() (which is " << this->size() << ")" << '\n'; } return this->at(n);
			}
		};
		template <typename T, std::size_t N> struct tuple_size<std::darray<T, N>> : integral_constant<std::size_t, N> {};
		template <typename T, std::size_t N, std::size_t I> struct tuple_element<I, std::darray<T, N>> { using type = T; };
		template <typename T, typename Compare = std::less<T>, typename Allocator = std::allocator<T>> class dmultiset : public std::multiset<T,Compare,Allocator> {
		public:
			using std::multiset<T,Compare,Allocator>::multiset;
			const typename std::multiset<T,Compare,Allocator>::iterator erase(const typename std::multiset<T,Compare,Allocator>::iterator it) {
				return std::multiset<T,Compare,Allocator>::erase(it);
			}
			std::size_t erase([[maybe_unused]] const T& x) {
				std::cerr << boost::stacktrace::stacktrace() << '\n'; assert(false);
			}
			std::size_t erase_all_elements(const T& x) {
				return std::multiset<T,Compare,Allocator>::erase(x);
			}
		};
	}
	#define vector dvector
	#define array darray
	#define multiset dmultiset
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
	void catch_SIGSEGV([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
#else
	#define erase_all_elements erase
#endif
#ifdef LOCAL_DEV
	template <typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
		return s << "(" << p.first << ", " << p.second << ")"; }
	template <typename T, std::size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (std::size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template <typename T, typename Compare> std::ostream& operator<<(std::ostream& s, const std::set<T, Compare>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template <typename T, typename Compare> std::ostream& operator<<(std::ostream& s, const std::multiset<T, Compare>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template <typename T1, typename T2, typename Compare> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2, Compare>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	template <typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
		for (std::size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template <typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
		for (std::size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template <typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T>>& vv) {
		s << "\\\n"; for (std::size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	template <typename T, std::size_t N, typename std::enable_if_t<!std::is_same_v<T, char>, std::nullptr_t> = nullptr> std::ostream& operator<<(std::ostream& s, const T (&v)[N]) {
		for (std::size_t i = 0; i < N; ++i){ s << v[i]; if (i < N - 1) s << "\t"; } return s; }
	template <typename T, std::size_t N, std::size_t M, typename std::enable_if_t<!std::is_same_v<T, char>, std::nullptr_t> = nullptr> std::ostream& operator<<(std::ostream& s, const T (&vv)[N][M]) {
		s << "\\\n"; for (std::size_t i = 0; i < N; ++i){ s << vv[i] << "\n"; } return s; }
	#if __has_include(<ext/pb_ds/assoc_container.hpp>)
		template <typename Key, typename Compare> std::ostream& operator<<(std::ostream& s, const __gnu_pbds::tree<Key, __gnu_pbds::null_type, Compare, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>& se) {
			s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
		template <typename Key, typename T, typename Hash> std::ostream& operator<<(std::ostream& s, const __gnu_pbds::gp_hash_table<Key, T, Hash>& m) {
			s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	#endif
	void debug_impl() { std::cerr << '\n'; }
	template <typename Head, typename... Tail> void debug_impl(Head& head, Tail&... tail) { std::cerr << " " << head << (sizeof...(Tail) ? "," : ""); debug_impl(tail...); }
	template <typename Head, typename... Tail> void debug_impl(const Head& head, const Tail&... tail) { std::cerr << " " << head << (sizeof...(Tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << ":" << __LINE__ << " (" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
	constexpr inline long long prodlocal([[maybe_unused]] long long prod, [[maybe_unused]] long long local) { return local; }
#else
	#define debug(...) do {} while (false)
	constexpr inline long long prodlocal([[maybe_unused]] long long prod, [[maybe_unused]] long long local) { return prod; }
#endif
#define repoverload3(_1, _2, _3, name, ...) name
#define rep3(i, a, b) for(ll i=(a), i##_length=(b); i<i##_length; ++i)
#define rep2(i, n) rep3(i, 0, n)
#define rep1(n) rep3(i, 0, n)
#define rep(...) repoverload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)
#define repeq3(i, a, b) rep3(i, (a)+1, (b)+1)
#define repeq2(i, n) rep3(i, 1, (n)+1)
#define repeq1(n) rep3(i, 1, (n)+1)
#define repeq(...) repoverload3(__VA_ARGS__, repeq3, repeq2, repeq1)(__VA_ARGS__)
#define rrep3(i, a, b) for(ll i=(b)-1; i>=(a); --i)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep1(n) rrep3(i, 0, n)
#define rrep(...) repoverload3(__VA_ARGS__, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define rrepeq3(i, a, b) rrep3(i, (a)+1, (b)+1)
#define rrepeq2(i, n) rrep3(i, 1, (n)+1)
#define rrepeq1(n) rrep3(i, 1, (n)+1)
#define rrepeq(...) repoverload3(__VA_ARGS__, rrepeq3, rrepeq2, rrepeq1)(__VA_ARGS__)
#define all(v) std::begin(v), std::end(v)
#define rall(v) std::rbegin(v), std::rend(v)
void p() { std::cout << '\n'; }
template <typename Head, typename... Tail> void p(Head& head, Tail&... tail) { std::cout << head << (sizeof...(Tail) ? " " : ""); p(tail...); }
template <typename Head, typename... Tail> void p(const Head& head, const Tail&... tail) { std::cout << head << (sizeof...(Tail) ? " " : ""); p(tail...); }
template <typename T, typename U = typename T::value_type> inline void pv(const T& v, const U& add = {}) { auto itbegin = std::begin(v), itend = std::end(v); for (auto it = itbegin; it != itend; std::advance(it, 1)) cout << (it == itbegin ? "" : " ") << *it + add; cout << '\n'; }
template <typename T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template <typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template <typename T> inline void uniq(T& v) { std::sort(v.begin(), v.end()); v.erase(std::unique(v.begin(), v.end()), v.end()); }
template <typename T> inline ll sz(const T& v) { return std::size(v); }
template <typename T, std::size_t N> std::vector<T> make_vector_impl(std::vector<ll>& sizes, typename std::enable_if<(N==1), const T&>::type x) { return std::vector<T>(sizes.front(),x); }
template <typename T, std::size_t N> auto make_vector_impl(std::vector<ll>& sizes, typename std::enable_if<(N>1), const T&>::type x) { ll size=sizes.back(); sizes.pop_back(); return std::vector<decltype(make_vector_impl<T,N-1>(sizes,x))>(size,make_vector_impl<T,N-1>(sizes,x)); }
template <typename T, std::size_t N> auto make_vector(const ll (&sizes)[N], const T& x=T()) { std::vector<ll> s(N); for(std::size_t i=0; i<N; ++i)s[i]=sizes[N-1-i]; return make_vector_impl<T,N>(s,x); }
template <typename T, std::size_t N> std::array<T,N> make_array() { return std::array<T,N>{}; }
template <typename T, std::size_t Head, std::size_t... Tail, typename std::enable_if_t<(sizeof...(Tail)>=1), std::nullptr_t> = nullptr> auto make_array() { return std::array<decltype(make_array<T,Tail...>()),Head>(); }
#if __has_include(<ext/pb_ds/assoc_container.hpp>)
	class custom_hash {
	public:
		static uint64_t splitmix64(uint64_t x) {
			x += 0x9e3779b97f4a7c15, x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9, x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31);
		}
		std::size_t operator()(uint64_t x) const {
			static const uint64_t FIXED_RANDOM = std::chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM);
		}
		std::size_t operator()(const std::string& x) const {
			return std::hash<std::string>()(x);
		}
	};
	template <typename Key, typename Mapped, typename Hash = custom_hash, typename std::enable_if_t<std::is_integral_v<Key> || std::is_same_v<Key, std::string>, std::nullptr_t> = nullptr> class fmap : public __gnu_pbds::gp_hash_table<Key, Mapped, Hash> {
	public:
		using __gnu_pbds::gp_hash_table<Key, Mapped, Hash>::gp_hash_table;
		template <typename T> fmap(std::initializer_list<std::initializer_list<T>> il) : __gnu_pbds::gp_hash_table<Key, Mapped, Hash>() {
			for (auto&& x : il) __gnu_pbds::gp_hash_table<Key, Mapped, Hash>::insert(std::pair<Key, Mapped>(*x.begin(), *(x.begin() + 1)));
		}
		template <typename T> ll count(const T& x) const {
			return __gnu_pbds::gp_hash_table<Key, Mapped, Hash>::find(x) != __gnu_pbds::gp_hash_table<Key, Mapped, Hash>::end();
		}
	};
#else
	template <typename Key, typename Mapped> using fmap = std::map<Key, Mapped>;
#endif
template <bool Index, typename... T> class zip_helper {
	class zip_iterator : std::iterator<std::forward_iterator_tag, std::tuple<decltype(*std::declval<T>().begin())...>> {
	public:
		ll idx_;
		std::tuple<decltype(std::declval<T>().begin())...> iters_;
		template <std::size_t... I> auto deref(std::index_sequence<I...>) const { return typename zip_iterator::value_type{*std::get<I>(iters_)...}; }
		template <std::size_t... I> void increment(std::index_sequence<I...>) { [[maybe_unused]] auto l = {(++std::get<I>(iters_), 0)...}; }
		explicit zip_iterator(decltype(iters_) iters) : idx_(0), iters_{std::move(iters)} {}
		zip_iterator& operator++() { ++idx_; increment(std::index_sequence_for<T...>{}); return *this; }
		zip_iterator operator++(int) { auto saved{*this}; ++idx_; increment(std::index_sequence_for<T...>{}); return saved; }
		bool operator!=(const zip_iterator& other) const { return iters_ != other.iters_; }
		template <bool Index_ = Index, typename std::enable_if_t<Index_, std::nullptr_t> = nullptr> auto operator*() const { return std::tuple_cat(std::make_tuple(this->idx_), this->deref(std::index_sequence_for<T...>{})); }
		template <bool Index_ = Index, typename std::enable_if_t<!Index_, std::nullptr_t> = nullptr> auto operator*() const { return this->deref(std::index_sequence_for<T...>{}); }
	};
public:
	zip_helper(T&... seqs) : begin_{std::make_tuple(seqs.begin()...)}, end_{std::make_tuple(seqs.end()...)} {}
	zip_iterator begin() const { return begin_; }
	zip_iterator end() const { return end_; }
	zip_iterator begin_, end_;
};
template <typename... T> auto zip(T&&... seqs) { return zip_helper<false, T...>{seqs...}; }
template <typename... T> auto zipindex(T&&... seqs) { return zip_helper<true, T...>{seqs...}; }

/*-----8<-----template-----8<-----*/

#ifdef __INTELLISENSE__
	#pragma diag_suppress 28
#endif
namespace modint_impl {
constexpr int ModintConstexprSize = prodlocal(30000, 10);
template <int N = ModintConstexprSize>
class ModintConstexpr {
public:
	unsigned int inv[N + 1];
	constexpr inline long long modpow(long long a, long long n) {
		long long res = 1;
		while (n) {
			if (n & 1) res = res * a % MOD;
			a = a * a % MOD;
			n >>= 1;
		}
		return res;
	}
	constexpr ModintConstexpr() : inv() {
		inv[1] = 1; for (int i = 2; i <= N; ++i) inv[i] = modpow(i, MOD - 2);
	}
};
constexpr auto modintconstexpr = ModintConstexpr<>();

namespace internal {
template <class T> using is_signed_int128 =  typename std::conditional<std::is_same<T, __int128_t>::value || std::is_same<T, __int128>::value, std::true_type, std::false_type>::type;
template <class T> using is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value || std::is_same<T, unsigned __int128>::value, std::true_type, std::false_type>::type;
template <class T> using make_unsigned_int128 = typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>;
template <class T> using is_integral = typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value || is_unsigned_int128<T>::value, std::true_type, std::false_type>::type;
template <class T> using is_signed_int = typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) || is_signed_int128<T>::value, std::true_type, std::false_type>::type;
template <class T> using is_unsigned_int = typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) || is_unsigned_int128<T>::value, std::true_type, std::false_type>::type;
template <class T> using to_unsigned = typename std::conditional<is_signed_int128<T>::value, make_unsigned_int128<T>, typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>, std::common_type<T>>::type>::type;
template <class T> using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;
template <class T> using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;
template <class T> using to_unsigned_t = typename to_unsigned<T>::type;
constexpr long long safe_mod(long long x, long long m) {
	x %= m; if (x < 0) x += m; return x;
}
constexpr long long pow_mod_constexpr(long long x, long long n, int m) {
	if (m == 1) return 0;
	unsigned int _m = (unsigned int)(m);
	unsigned long long r = 1, y = safe_mod(x, m);
	while (n) {
		if (n & 1) r = (r * y) % _m;
		y = (y * y) % _m;
		n >>= 1;
	}
	return r;
}
constexpr bool is_prime_constexpr(int n) {
	if (n <= 1) return false;
	if (n == 2 || n == 7 || n == 61) return true;
	if (n % 2 == 0) return false;
	long long d = n - 1;
	while (d % 2 == 0) d /= 2;
	constexpr long long bases[3] = {2, 7, 61};
	for (long long a : bases) {
		long long t = d, y = pow_mod_constexpr(a, t, n);
		while (t != n - 1 && y != 1 && y != n - 1) y = y * y % n, t <<= 1;
		if (y != n - 1 && t % 2 == 0) return false;
	}
	return true;
}
template <int n> constexpr bool is_prime = is_prime_constexpr(n);
constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {
	a = safe_mod(a, b);
	if (a == 0) return {b, 0};
	long long s = b, t = a, m0 = 0, m1 = 1;
	while (t) {
		long long u = s / t;
		s -= t * u;
		m0 -= m1 * u;
		auto tmp = s;
		s = t, t = tmp, tmp = m0, m0 = m1, m1 = tmp;
	}
	if (m0 < 0) m0 += b / s;
	return {s, m0};
}
} // namespace internal

constexpr uint32_t totient(uint32_t x) {
	uint32_t ans = x;
	for (uint32_t i = 2; i * i <= x; i++) if(x % i == 0) { ans /= i; ans *= i - 1; do x /= i; while(x % i == 0); }
	if (x != 1) { ans /= x; ans *= x - 1; }
	return ans;
}
template<uint32_t P> class ModintPow {
private:
	static uint32_t mod(uint64_t x) { return x < P * 2 ? uint32_t(x) : uint32_t(x % P) + P; }
	static uint32_t mul(uint32_t a, uint32_t b) { return mod(uint64_t(a) * b); }
	static uint32_t pow(uint32_t a, uint32_t b) { uint32_t ans = 1; while(b){ if(b & 1) ans = mul(ans, a); a = mul(a, a); b >>= 1; } return ans; }
public:
	static_assert(P < 0x80000000, "P must be smaller than 2^31");
	uint32_t a;
	ModintPow<totient(P)> b;
	ModintPow(uint64_t x) : a(mod(x)), b(x){}
	ModintPow(uint32_t a, const ModintPow<totient(P)>& b) : a(a), b(b){}
	uint32_t val() const { return a < P ? a : a - P; }
	ModintPow pow(const ModintPow& other) const { return {pow(a, other.b.a), b.pow(other.b)}; };
};
template<> class ModintPow<1> {
public:
	uint32_t a;
	ModintPow(uint64_t x): a(bool(x)){}
	uint32_t val() const { return 0; }
	ModintPow pow(const ModintPow& other) const { return {a || !other.a}; }
};

template <int m, std::enable_if_t<(1 <= m)>* = nullptr>
class static_modint_custom {
public:
	using mint = static_modint_custom;
#if __has_include(<ext/pb_ds/assoc_container.hpp>)
	using inv_cache_type = fmap<unsigned int, unsigned int>;
#else
	using inv_cache_type = std::map<unsigned int, unsigned int>;
#endif
	inline static inv_cache_type inv_cache = {};
	static_modint_custom() : _v(0) {}
	template <class T, internal::is_signed_int_t<T>* = nullptr>
	static_modint_custom(T v) { long long x = (long long)(v % (long long)(umod())); if (x < 0) x += umod(); _v = (unsigned int)(x); }
	template <class T, internal::is_unsigned_int_t<T>* = nullptr>
	static_modint_custom(T v) { _v = (unsigned int)(v % umod()); }

	static constexpr int mod() { return m; }
	static mint raw(int v) { mint x; x._v = v; return x; }
	unsigned int val() const { return _v; }
	mint& operator++() { _v++; if (_v == umod()) _v = 0; return *this; }
	mint& operator--() { if (_v == 0) _v = umod(); _v--; return *this; }
	mint operator++(int) { mint result = *this; ++*this; return result; }
	mint operator--(int) { mint result = *this; --*this; return result; }
	mint& operator+=(const mint& rhs) { _v += rhs._v; if (_v >= umod()) _v -= umod(); return *this; }
	mint& operator-=(const mint& rhs) { _v -= rhs._v; if (_v >= umod()) _v += umod(); return *this; }
	mint& operator*=(const mint& rhs) { unsigned long long z = _v; z *= rhs._v; _v = (unsigned int)(z % umod()); return *this; }
	mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
	mint operator+() const { return *this; }
	mint operator-() const { return mint() - *this; }
	mint pow(long long n) const {
		mint x = *this, r = 1;
		if (n < 0) x = inv(), n = -n;
		while (n) {
			if (n & 1) r *= x;
			x *= x;
			n >>= 1;
		}
		return r;
	}
	mint powvec(const std::vector<long long>& v) const {
		ModintPow<umod()> x(1);
		for (int i = (int)v.size() - 1; i >= 0; --i) x = ModintPow<umod()>(v[i]).pow(x);
		return ModintPow<umod()>(_v).pow(x).a;
	}
	mint inv() const {
		if (umod() == MOD && _v <= ModintConstexprSize) return raw(modintconstexpr.inv[_v]);
		unsigned int cached = inv_cache[_v];
		if (cached) return raw(cached);
		mint x = inv_calc();
		inv_cache[_v] = x._v;
		return x;
	}
	mint inv_calc() const {
		if (prime) {
			assert(_v);
			return pow(umod() - 2);
		} else {
			auto eg = internal::inv_gcd(_v, m);
			assert(eg.first == 1);
			return eg.second;
		}
	}
	friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }
	friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }
	friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }
	friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }
	friend bool operator==(const mint& lhs, const mint& rhs) { return lhs._v == rhs._v; }
	friend bool operator!=(const mint& lhs, const mint& rhs) { return lhs._v != rhs._v; }
	friend bool operator<(const mint& lhs, const mint& rhs) { return lhs._v < rhs._v; }
private:
	unsigned int _v;
	static constexpr unsigned int umod() { return m; }
	static constexpr bool prime = internal::is_prime<m>;
};
} // namespace modint_impl
using Modint = modint_impl::static_modint_custom<MOD>;
std::istream& operator>>(std::istream& is, Modint& x){ ll a; is >> a; x = a; return is; }
std::ostream& operator<<(std::ostream& os, const Modint& x){ return os << x.val(); }
inline Modint operator""_M(unsigned long long x) noexcept { return Modint(x); }
std::vector<Modint> fac_vec{1}, inv_vec{1};
inline void reserve_fac_vec(size_t a){
	if(fac_vec.size() >= a) return;
	if(a < fac_vec.size() * 2) a = fac_vec.size() * 2;
	if(a >= (size_t)Modint::mod()) a = Modint::mod();
	fac_vec.reserve(a);
	while(fac_vec.size() < a) fac_vec.push_back(fac_vec.back() * fac_vec.size());
	inv_vec.resize(a);
	inv_vec.back() = fac_vec.back().inv();
	for(int i = inv_vec.size() - 1; !inv_vec[i - 1].val(); i--) inv_vec[i - 1] = inv_vec[i] * i;
}
inline Modint factorial(ll n){ if(n < 0) return 0; reserve_fac_vec(n + 1); return fac_vec[n]; }
inline Modint factorialinv(ll n){ if(n < 0) return 0; reserve_fac_vec(n + 1); return inv_vec[n]; }
inline Modint nPk(ll n, ll r){
	if(r < 0 || n < r) return 0;
	if(n >> 24){ Modint ans = 1; for(int i = 0; i < r; i++) ans *= n--; return ans; }
	reserve_fac_vec(n + 1); return fac_vec[n] * inv_vec[n - r];
}
inline Modint nCk(ll n, ll r){ if(r < 0 || n < r) return 0; r = min(r, n - r); reserve_fac_vec(r + 1); return inv_vec[r] * nPk(n, r); }
inline Modint nHk(ll n, ll r){ return nCk(n + r - 1, n - 1); } //n種類のものから重複を許してr個選ぶ=玉r個と仕切りn-1個
inline Modint catalan(ll n){ reserve_fac_vec(n * 2 + 1); return fac_vec[n * 2] * inv_vec[n] * inv_vec[n + 1]; }
//パスカルの三角形 横m項の和をn段分求める res[i]=Σ[k=0..min(i,m)]nCk(i,k)
inline std::vector<Modint> nCksum(ll n, ll m){
	std::vector<Modint> res(n); res[0] = 1;
	for (int i = 0; i < n - 1; i++) res[i + 1] = res[i] * 2 - nCk(i, m);
	return res;
}

////

//[lib]imos_漸化式.cpp
//https://theory-and-me.hatenablog.com/entry/2020/08/23/182712
//https://yukicoder.me/submissions/479811
//漸化式add
template<typename T>
class Imos_recurrence {
public:
	int sz;
	vector<T> rui;
	std::vector<std::vector<int>> addv, subv;
	bool isbuilt = false;
	Imos_recurrence(int sz) : sz(sz), rui(sz+1, 0), addv(sz+1), subv(sz+1) {}

	//初期値セット
	void set(int k, const T& val) {
		rui[k] = val;
	}

	//等比数列加算 初項a, 漸化式の係数bを足す方式に設定
	vector<T> a, b;
	void set_recurrence(const vector<T>& a_, const vector<T>& b_) {
		a = a_, b = b_;
		std::reverse(b.begin(), b.end());
		int k = b.size();
		// a_{n + k} まで計算する
		a.resize(k + sz, 0);
		for (int i = 0; i < sz; ++i) {
			for (int j = 0; j < k; ++j) {
				a[i + k] += a[i + j] * b[j];
			}
		}
	}

	//初項a, 漸化式の係数bを[l,r)に加算
	void add(int l, int r) {
		addv[l].push_back(0);
		subv[r].push_back(r - l);
	}

	void build() {
		isbuilt = true;
		int k = b.size();
		std::vector<T> s(k, 0);
		for (int i = 0; i < sz; ++i) {
			// s を 1 つ進める
			T t = 0;
			for (int j = 0; j < k; ++j) {
				t += s[j] * b[j];
			}
			s.erase(s.begin());
			s.push_back(t);

			for (int l : addv[i]) {
				for (int j = 0; j < k; ++j) {
					s[j] += a[l + j];
				}
			}

			for (int l : subv[i]) {
				for (int j = 0; j < k; ++j) {
					s[j] -= a[l + j];
				}
			}

			//std::cout << s[0].v << "\n";
			rui[i] += s[0];
		}

		//累積和構築
		for (int i = sz; i > 0; --i) {
			rui[i - 1] += rui[i];
		}
	}

	T sum(int l, int r) {
		if (!isbuilt) build();
		if (l >= r) return 0;
		return rui[l] - rui[r];
	}

	T operator[](int k) { return sum(k, k+1); }
	T front() { return operator[](0); }
	T back() { return operator[](sz-1); }
	int size() const { return sz; }
};
template<typename T> std::ostream& operator<<(std::ostream& s, Imos_recurrence<T>& imos) { 
	for(int i=0; i<imos.sz; i++) s << imos.sum(i, i+1) << "\t\n"[i==imos.sz-1];
	return s;
}

/*-----8<-----library-----8<-----*/

void solve() {
	ll K, N, M;
	cin >> K >> N >> M;
	vector<Modint> a(K), c(K);
	rep(i, K) cin >> a[i];
	rep(i, K) cin >> c[i];
	
	//初項a, 漸化式の係数c
	//a[i] = Σ[k=1..K] a[i]*c[i-k]
	Imos_recurrence<Modint> imos(N);
	imos.set_recurrence(a, c);
	while (M--) {
		ll l, r;
		cin >> l >> r;
		imos.add(l, r);
		//debug(imos);
	}

	rep(i, N) {
		p(imos[i]);
	}

	std::cout << std::flush;
	_Exit(0);
}

// https://yukicoder.me/problems/no/1172
signed main() {
#ifdef LOCAL_DEV
	//std::ifstream in("in.txt");
	//std::cin.rdbuf(in.rdbuf());
#else
	std::cin.tie(nullptr);
	std::ios::sync_with_stdio(false);
#endif
	//ll Q; cin >> Q; while(Q--)solve();
	solve();
	return 0;
}
0