День рождения

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<string>
#include<set>
#include<algorithm>
#include<vector>
#include<map>
#include<iomanip>
 
using namespace std;
 
#define DB(a) cout<<#a<<"="<<a<<" ";
#define DBN(a) cout<<#a<<"="<<a<<endl;
 
typedef string ss;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef map<int, int> mii;
typedef set<int> seti;
 
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define sqrt(a) (sqrt(1.0*(a)))
#define sqr(a) ((a)*(a))
#define all(a) (a.begin(),a.end())
 
typedef struct {
    ll x;
    ll y;
} date;
 
typedef struct {
    ll d;
    ll m;
    ll year;
} now;
const int mod = 1000000007; // const int mod = 1000000009;
const double EPS = 1E-7;
 
bool used[100001];
vi g[100001];
int t;
int k = 0;
bool go = false;
 
int main() {
    date birthday;
    now nowaday;
    ll m = 0, s = 0;
    const int n = 12;
    //    ll arr[] {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
    ll arr[n];
    arr[0] = 31;
    arr[1] = 28;
    arr[2] = 31;
    arr[3] = 30;
    arr[4] = 31;
    arr[5] = 30;
    arr[6] = 31;
    arr[7] = 31;
    arr[8] = 30;
    arr[9] = 31;
    arr[10] = 30;
    arr[11] = 31;
 
    cin >> birthday.x >> birthday.y;
    cin >> nowaday.d >> nowaday.m >> nowaday.year;
    if (nowaday.year % 4 == 0 && nowaday.year % 100 != 0 || nowaday.year % 400 == 0) {
        arr[1] = 29;
    }
    if (birthday.y > nowaday.m) {
        for (int i = nowaday.m; i < birthday.y; i++)
            m += arr[i];
        m -= nowaday.d;
        cout << m << endl;
    }
    //    for (int i = 0; i < 12; i++) {
    //        cout << arr[i] << endl;
    //
    //
    //    }
 
 
    return 0;
}