結果

問題 No.3083 12歳
ユーザー iiljjiiljj
提出日時 2021-04-01 20:57:20
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 9,066 bytes
コンパイル時間 1,373 ms
コンパイル使用メモリ 136,112 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-06-01 02:35:09
合計ジャッジ時間 10,459 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 2 ms
6,944 KB
testcase_12 AC 2 ms
6,940 KB
testcase_13 AC 2 ms
6,940 KB
testcase_14 AC 2 ms
6,940 KB
testcase_15 AC 2 ms
6,944 KB
testcase_16 AC 2 ms
6,944 KB
testcase_17 AC 2 ms
6,944 KB
testcase_18 AC 1 ms
6,940 KB
testcase_19 AC 2 ms
6,940 KB
testcase_20 AC 2 ms
6,940 KB
testcase_21 AC 2 ms
6,944 KB
testcase_22 AC 2 ms
6,940 KB
testcase_23 AC 2 ms
6,944 KB
testcase_24 AC 2 ms
6,940 KB
testcase_25 AC 2 ms
6,940 KB
testcase_26 AC 2 ms
6,944 KB
testcase_27 AC 2 ms
6,940 KB
testcase_28 AC 2 ms
6,944 KB
testcase_29 AC 2 ms
6,940 KB
testcase_30 AC 2 ms
6,944 KB
testcase_31 AC 2 ms
6,944 KB
testcase_32 AC 2 ms
6,944 KB
testcase_33 AC 2 ms
6,944 KB
testcase_34 AC 2 ms
6,940 KB
testcase_35 AC 2 ms
6,944 KB
testcase_36 AC 2 ms
6,940 KB
testcase_37 AC 2 ms
6,944 KB
testcase_38 AC 2 ms
6,940 KB
testcase_39 AC 2 ms
6,940 KB
testcase_40 AC 2 ms
6,940 KB
testcase_41 AC 2 ms
6,940 KB
testcase_42 AC 2 ms
6,940 KB
testcase_43 AC 2 ms
6,944 KB
testcase_44 AC 2 ms
6,944 KB
testcase_45 AC 2 ms
6,940 KB
testcase_46 AC 2 ms
6,944 KB
testcase_47 AC 2 ms
6,948 KB
testcase_48 AC 2 ms
6,944 KB
testcase_49 AC 2 ms
6,944 KB
testcase_50 AC 2 ms
6,948 KB
testcase_51 AC 2 ms
6,944 KB
testcase_52 AC 2 ms
6,940 KB
testcase_53 AC 2 ms
6,940 KB
testcase_54 AC 2 ms
6,940 KB
testcase_55 AC 2 ms
6,944 KB
testcase_56 AC 2 ms
6,940 KB
testcase_57 AC 2 ms
6,944 KB
testcase_58 AC 2 ms
6,944 KB
testcase_59 AC 2 ms
6,940 KB
testcase_60 WA -
testcase_61 WA -
testcase_62 AC 2 ms
6,940 KB
testcase_63 AC 2 ms
6,940 KB
testcase_64 AC 2 ms
6,940 KB
testcase_65 AC 2 ms
6,940 KB
testcase_66 WA -
testcase_67 AC 2 ms
6,944 KB
testcase_68 AC 2 ms
6,940 KB
testcase_69 AC 2 ms
6,940 KB
testcase_70 WA -
testcase_71 AC 2 ms
6,944 KB
testcase_72 AC 2 ms
6,940 KB
testcase_73 AC 2 ms
6,940 KB
testcase_74 AC 2 ms
6,940 KB
testcase_75 AC 2 ms
6,940 KB
testcase_76 AC 2 ms
6,940 KB
testcase_77 AC 2 ms
6,944 KB
testcase_78 AC 2 ms
6,940 KB
testcase_79 AC 2 ms
6,940 KB
testcase_80 AC 2 ms
6,948 KB
testcase_81 AC 2 ms
6,940 KB
testcase_82 WA -
testcase_83 WA -
testcase_84 WA -
testcase_85 AC 2 ms
6,940 KB
testcase_86 AC 2 ms
6,940 KB
testcase_87 AC 2 ms
6,940 KB
testcase_88 AC 2 ms
6,944 KB
testcase_89 AC 2 ms
6,944 KB
testcase_90 AC 2 ms
6,940 KB
testcase_91 WA -
testcase_92 WA -
testcase_93 WA -
testcase_94 AC 2 ms
6,940 KB
testcase_95 AC 2 ms
6,944 KB
testcase_96 AC 2 ms
6,940 KB
testcase_97 AC 2 ms
6,940 KB
testcase_98 WA -
testcase_99 WA -
testcase_100 AC 2 ms
6,940 KB
testcase_101 AC 2 ms
6,940 KB
testcase_102 AC 2 ms
6,944 KB
testcase_103 AC 2 ms
6,940 KB
testcase_104 WA -
testcase_105 WA -
testcase_106 WA -
testcase_107 WA -
testcase_108 WA -
testcase_109 AC 2 ms
6,940 KB
testcase_110 AC 2 ms
6,944 KB
testcase_111 AC 2 ms
6,944 KB
testcase_112 WA -
testcase_113 WA -
testcase_114 WA -
testcase_115 WA -
testcase_116 AC 2 ms
6,940 KB
testcase_117 WA -
testcase_118 WA -
testcase_119 AC 2 ms
6,940 KB
testcase_120 AC 2 ms
6,940 KB
testcase_121 AC 2 ms
6,940 KB
testcase_122 AC 2 ms
6,944 KB
testcase_123 WA -
testcase_124 AC 2 ms
6,940 KB
testcase_125 AC 2 ms
6,940 KB
testcase_126 AC 2 ms
6,948 KB
testcase_127 WA -
testcase_128 AC 2 ms
6,944 KB
testcase_129 AC 2 ms
6,940 KB
testcase_130 AC 2 ms
6,940 KB
testcase_131 AC 2 ms
6,940 KB
testcase_132 AC 2 ms
6,940 KB
testcase_133 AC 2 ms
6,944 KB
testcase_134 AC 2 ms
6,944 KB
testcase_135 AC 2 ms
6,944 KB
testcase_136 AC 2 ms
6,944 KB
testcase_137 AC 2 ms
6,944 KB
testcase_138 AC 2 ms
6,940 KB
testcase_139 WA -
testcase_140 WA -
testcase_141 WA -
testcase_142 AC 2 ms
6,944 KB
testcase_143 AC 2 ms
6,944 KB
testcase_144 AC 2 ms
6,948 KB
testcase_145 AC 2 ms
6,944 KB
testcase_146 AC 2 ms
6,944 KB
testcase_147 AC 2 ms
6,944 KB
testcase_148 WA -
testcase_149 WA -
testcase_150 WA -
testcase_151 AC 2 ms
6,944 KB
testcase_152 AC 2 ms
6,940 KB
testcase_153 AC 2 ms
6,944 KB
testcase_154 AC 2 ms
6,944 KB
testcase_155 WA -
testcase_156 WA -
testcase_157 AC 2 ms
6,940 KB
testcase_158 AC 2 ms
6,944 KB
testcase_159 AC 2 ms
6,940 KB
testcase_160 AC 2 ms
6,944 KB
testcase_161 WA -
testcase_162 WA -
testcase_163 WA -
testcase_164 WA -
testcase_165 WA -
testcase_166 AC 2 ms
6,940 KB
testcase_167 AC 2 ms
6,940 KB
testcase_168 AC 2 ms
6,940 KB
testcase_169 WA -
testcase_170 WA -
testcase_171 WA -
testcase_172 WA -
testcase_173 AC 2 ms
6,944 KB
testcase_174 AC 2 ms
6,944 KB
testcase_175 AC 2 ms
6,944 KB
testcase_176 AC 2 ms
6,940 KB
testcase_177 AC 2 ms
6,944 KB
testcase_178 AC 2 ms
6,944 KB
testcase_179 AC 2 ms
6,940 KB
testcase_180 AC 2 ms
6,944 KB
testcase_181 AC 2 ms
6,940 KB
testcase_182 AC 2 ms
6,940 KB
testcase_183 AC 2 ms
6,940 KB
testcase_184 AC 2 ms
6,940 KB
testcase_185 AC 2 ms
6,944 KB
testcase_186 AC 2 ms
6,940 KB
testcase_187 AC 2 ms
6,940 KB
testcase_188 AC 2 ms
6,944 KB
testcase_189 AC 2 ms
6,944 KB
testcase_190 AC 2 ms
6,944 KB
testcase_191 AC 2 ms
6,940 KB
testcase_192 AC 2 ms
6,944 KB
testcase_193 AC 2 ms
6,940 KB
testcase_194 AC 2 ms
6,940 KB
testcase_195 AC 2 ms
6,944 KB
testcase_196 AC 2 ms
6,940 KB
testcase_197 AC 2 ms
6,944 KB
testcase_198 AC 2 ms
6,944 KB
testcase_199 AC 2 ms
6,944 KB
testcase_200 AC 2 ms
6,940 KB
testcase_201 AC 2 ms
6,940 KB
testcase_202 AC 2 ms
6,940 KB
testcase_203 AC 2 ms
6,944 KB
testcase_204 AC 2 ms
6,944 KB
testcase_205 AC 2 ms
6,944 KB
testcase_206 AC 2 ms
6,940 KB
testcase_207 AC 2 ms
6,940 KB
testcase_208 AC 2 ms
6,940 KB
testcase_209 AC 2 ms
6,940 KB
testcase_210 AC 2 ms
6,944 KB
testcase_211 AC 2 ms
6,940 KB
testcase_212 AC 2 ms
6,940 KB
testcase_213 AC 2 ms
6,940 KB
testcase_214 AC 2 ms
6,948 KB
testcase_215 AC 2 ms
6,940 KB
testcase_216 AC 2 ms
6,944 KB
testcase_217 AC 2 ms
6,940 KB
testcase_218 AC 2 ms
6,940 KB
testcase_219 AC 2 ms
6,944 KB
testcase_220 AC 2 ms
6,944 KB
testcase_221 AC 2 ms
6,940 KB
testcase_222 AC 2 ms
6,944 KB
testcase_223 AC 2 ms
6,944 KB
testcase_224 AC 2 ms
6,940 KB
testcase_225 AC 3 ms
6,944 KB
testcase_226 AC 2 ms
6,940 KB
testcase_227 AC 2 ms
6,944 KB
testcase_228 AC 2 ms
6,944 KB
testcase_229 AC 2 ms
6,940 KB
testcase_230 AC 2 ms
6,940 KB
testcase_231 WA -
testcase_232 WA -
testcase_233 AC 2 ms
6,944 KB
testcase_234 AC 2 ms
6,948 KB
testcase_235 AC 2 ms
6,940 KB
testcase_236 AC 2 ms
6,940 KB
testcase_237 WA -
testcase_238 AC 2 ms
6,940 KB
testcase_239 AC 2 ms
6,940 KB
testcase_240 AC 2 ms
6,944 KB
testcase_241 WA -
testcase_242 AC 2 ms
6,944 KB
testcase_243 AC 2 ms
6,944 KB
testcase_244 AC 2 ms
6,940 KB
testcase_245 AC 2 ms
6,944 KB
testcase_246 AC 2 ms
6,944 KB
testcase_247 AC 2 ms
6,940 KB
testcase_248 AC 2 ms
6,944 KB
testcase_249 AC 2 ms
6,944 KB
testcase_250 AC 2 ms
6,940 KB
testcase_251 AC 2 ms
6,944 KB
testcase_252 AC 2 ms
6,944 KB
testcase_253 WA -
testcase_254 WA -
testcase_255 WA -
testcase_256 AC 2 ms
6,940 KB
testcase_257 AC 2 ms
6,940 KB
testcase_258 AC 2 ms
6,940 KB
testcase_259 AC 2 ms
6,944 KB
testcase_260 AC 2 ms
6,940 KB
testcase_261 AC 2 ms
6,940 KB
testcase_262 WA -
testcase_263 WA -
testcase_264 WA -
testcase_265 AC 2 ms
6,940 KB
testcase_266 AC 2 ms
6,944 KB
testcase_267 AC 2 ms
6,944 KB
testcase_268 AC 2 ms
6,944 KB
testcase_269 WA -
testcase_270 WA -
testcase_271 AC 2 ms
6,944 KB
testcase_272 AC 2 ms
6,944 KB
testcase_273 AC 2 ms
6,940 KB
testcase_274 AC 2 ms
6,940 KB
testcase_275 WA -
testcase_276 WA -
testcase_277 WA -
testcase_278 WA -
testcase_279 WA -
testcase_280 AC 2 ms
6,940 KB
testcase_281 AC 2 ms
6,944 KB
testcase_282 AC 2 ms
6,944 KB
testcase_283 WA -
testcase_284 WA -
testcase_285 WA -
testcase_286 WA -
testcase_287 AC 2 ms
6,944 KB
testcase_288 WA -
testcase_289 WA -
testcase_290 AC 2 ms
6,940 KB
testcase_291 AC 2 ms
6,940 KB
testcase_292 AC 2 ms
6,940 KB
testcase_293 AC 2 ms
6,940 KB
testcase_294 WA -
testcase_295 AC 2 ms
6,944 KB
testcase_296 AC 2 ms
6,944 KB
testcase_297 AC 2 ms
6,940 KB
testcase_298 WA -
testcase_299 AC 2 ms
6,944 KB
testcase_300 AC 2 ms
6,944 KB
testcase_301 AC 2 ms
6,940 KB
testcase_302 AC 2 ms
6,940 KB
testcase_303 AC 2 ms
6,940 KB
testcase_304 AC 2 ms
6,944 KB
testcase_305 AC 2 ms
6,944 KB
testcase_306 AC 2 ms
6,940 KB
testcase_307 AC 2 ms
6,940 KB
testcase_308 AC 2 ms
6,940 KB
testcase_309 AC 2 ms
6,944 KB
testcase_310 WA -
testcase_311 WA -
testcase_312 WA -
testcase_313 AC 2 ms
6,940 KB
testcase_314 AC 2 ms
6,944 KB
testcase_315 AC 2 ms
6,944 KB
testcase_316 AC 2 ms
6,940 KB
testcase_317 AC 2 ms
6,940 KB
testcase_318 AC 2 ms
6,944 KB
testcase_319 WA -
testcase_320 WA -
testcase_321 WA -
testcase_322 AC 2 ms
6,940 KB
testcase_323 AC 2 ms
6,940 KB
testcase_324 AC 2 ms
6,944 KB
testcase_325 AC 2 ms
6,940 KB
testcase_326 WA -
testcase_327 WA -
testcase_328 AC 2 ms
6,944 KB
testcase_329 AC 2 ms
6,940 KB
testcase_330 AC 2 ms
6,940 KB
testcase_331 AC 2 ms
6,944 KB
testcase_332 WA -
testcase_333 WA -
testcase_334 WA -
testcase_335 WA -
testcase_336 WA -
testcase_337 AC 2 ms
6,940 KB
testcase_338 AC 2 ms
6,944 KB
testcase_339 AC 2 ms
6,940 KB
testcase_340 WA -
testcase_341 WA -
testcase_342 WA -
testcase_343 WA -
testcase_344 AC 2 ms
6,940 KB
testcase_345 AC 2 ms
6,944 KB
testcase_346 WA -
testcase_347 AC 2 ms
6,940 KB
testcase_348 AC 2 ms
6,944 KB
testcase_349 AC 2 ms
6,940 KB
testcase_350 AC 2 ms
6,944 KB
testcase_351 AC 2 ms
6,944 KB
testcase_352 AC 2 ms
6,940 KB
testcase_353 WA -
testcase_354 AC 2 ms
6,940 KB
testcase_355 WA -
testcase_356 AC 2 ms
6,940 KB
testcase_357 AC 2 ms
6,940 KB
testcase_358 AC 2 ms
6,944 KB
testcase_359 WA -
testcase_360 AC 2 ms
6,940 KB
testcase_361 WA -
testcase_362 AC 2 ms
6,940 KB
testcase_363 WA -
testcase_364 AC 2 ms
6,944 KB
testcase_365 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail) > 0) cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    cin >> __VA_ARGS__;

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

bool is_uruu(ll y) { return ((y % 4 == 0 && y % 100 != 0) || y % 400 == 0) ? true : false; }

// Problem
void solve() {
    VAR(ll, y, n, d); //
    ll born_maybe_uruu = y - 12;
    bool uruu = is_uruu(born_maybe_uruu);
    bool uruu2 = is_uruu(y + 1);
    if (uruu) {
        if (uruu2) {
            // 4/2-4/1, 366
            ll mi = max(0LL, n - d);
            ll ma = min(366LL - d, n);
            pprint(mi, ma);
        } else {
            // 生まれは閏年だけど今度は閏年じゃない
            ll mi, ma;

            if (n < 334)
                mi = max(0LL, n - d);
            else
                mi = max(0LL, n - d - 1);

            if (n < 334)
                ma = min(366LL - d, n);
            else
                ma = min(365LL - d, n);

            pprint(mi, ma);
        }
    } else {
        if (!uruu2) {
            // 4/2-4/1, 365
            ll mi = max(0LL, n - d);
            ll ma = min(365LL - d, n);
            pprint(mi, ma);
        } else {
            // 生まれは閏年じゃないけど今度は閏年
            // 4/2 を 0日目 として 333日目
            // 4/2 を 1日目 として 334日目
            ll mi, ma;
            if (n < 334)
                mi = max(0LL, n - d);
            else
                mi = max(0LL, n + 1 - d);

            if (n < 334)
                ma = min(365LL - d, n);
            else
                ma = min(366LL - d, n);

            pprint(mi, ma);
        }
    }
}

// entry point
int main() {
    solve();
    return 0;
}
0