//By SiriusRen

#include <bits/stdc++.h>

using namespace std;

int tx,ty,T;

bool check(){

    int rx=tx/,ry=tx%;

    return ry*+rx==ty;

}

int main(){

    scanf("%d:%d",&tx,&ty);

    while(){

        if(check()){printf("%d\n",T);return ;}

        T++,ty++;

        if(ty==)tx++,ty=;

        if(tx==)tx=;

    }

}

//By SiriusRen

#include <bits/stdc++.h>

using namespace std;

const int N=;

int n,k,q,xx,yy,a[N],s[N];

int main(){

    scanf("%d%d%d",&n,&k,&q);

    for(int i=;i<=n;i++)scanf("%d%d",&xx,&yy),a[xx]++,a[yy+]--;

    for(int i=;i<N;i++)a[i]+=a[i-];

    for(int i=;i<N;i++)s[i]=s[i-]+(a[i]>=k);

    for(int i=;i<=q;i++)scanf("%d%d",&xx,&yy),printf("%d\n",s[yy]-s[xx-]);

}

//By SiriusRen

#include <bits/stdc++.h>

using namespace std;

const int N=;

int n,m,a[N][N],minn=N,rec[N],recl[N],T;

int main(){

    scanf("%d%d",&n,&m);memset(rec,0x3f,sizeof(rec));memset(recl,0x3f,sizeof(recl));

    for(int i=;i<=n;i++)for(int j=;j<=m;j++)scanf("%d",&a[i][j]),minn=min(minn,a[i][j]);

    for(int i=;i<=n;i++)for(int j=;j<=m;j++)a[i][j]-=minn;

    for(int i=;i<=n;i++){

        for(int j=;j<=m;j++)rec[i]=min(rec[i],a[i][j]);

        for(int j=;j<=m;j++)a[i][j]-=rec[i];

    }

    for(int i=;i<=n;i++)for(int j=;j<=m;j++)if(a[i][j]!=a[][j]){puts("-1");return ;}else recl[j]=min(recl[j],a[i][j]);

    for(int i=;i<=n;i++)for(int j=;j<=rec[i];j++)T++;

    for(int i=;i<=m;i++)for(int j=;j<=recl[i];j++)T++;

    if(n<m)for(int i=;i<=minn;i++)for(int j=;j<=n;j++)T++;

    else for(int i=;i<=minn;i++)for(int j=;j<=m;j++)T++;

    printf("%d\n",T);

    for(int i=;i<=n;i++)for(int j=;j<=rec[i];j++)printf("row %d\n",i);

    for(int i=;i<=m;i++)for(int j=;j<=recl[i];j++)printf("col %d\n",i);

    if(n<m)for(int i=;i<=minn;i++)for(int j=;j<=n;j++)printf("row %d\n",j);

    else for(int i=;i<=minn;i++)for(int j=;j<=m;j++)printf("col %d\n",j);

}

//By SiriusRen

#include <bits/stdc++.h>

using namespace std;

const int N=,mod=;

int n,a[N],ans1,ans2,tot,fac[N],inv[N];

int C(int x,int y){return 1ll*fac[x]*inv[y]%mod*inv[x-y]%mod;}

int pow(int x,int y){

    int r=;

    while(y){

        if(y&)r=1ll*r*x%mod;

        x=1ll*x*x%mod,y>>=;

    }return r;

}

int main(){

    scanf("%d",&n),fac[]=;

    for(int i=;i<=n;i++)scanf("%d",&a[i]),tot+=i-;

    for(int i=;i<=n;i++)fac[i]=1ll*fac[i-]*i%mod;

    for(int i=;i<=n;i++)inv[i]=pow(fac[i],mod-);

    if(n==){printf("%d\n",a[]);return ;}

    if(n&){

        for(int i=;i<n;i++)a[i]=i&?(a[i]+a[i+]):(a[i]-a[i+]);n--;

    }

    for(int i=;i<=n;i+=)ans1=(ans1+1ll*a[i]*C(n/-,i/))%mod;

    for(int i=;i<=n;i+=)ans2=(ans2+1ll*a[i]*C(n/-,i/-))%mod;

    printf("%d\n",((tot&?(ans1+ans2)%mod:ans1-ans2)+mod)%mod);

}

//By SiriusRen

#include <bits/stdc++.h>

using namespace std;

const int N=;

int first[N],nxt[N],v[N],tot,c[N],d[N],fa[N],n,k,f[N][N],g[N][N],size[N],ans;

void add(int x,int y){v[tot]=y,nxt[tot]=first[x],first[x]=tot++;}

void dfs(int x){

    f[x][]=g[x][]=,size[x]=;g[x][]=c[x];

    for(int i=first[x];~i;i=nxt[i]){

        dfs(v[i]);

        for(int j=size[x];~j;j--){

            for(int k=size[v[i]];~k;k--){

                f[x][j+k]=min(f[x][j+k],f[x][j]+f[v[i]][k]);

            }

        }

        for(int j=size[x];~j;j--){

            for(int k=size[v[i]];~k;k--){

                g[x][j+k]=min(g[x][j+k],g[x][j]+g[v[i]][k]);

            }

        }

        size[x]+=size[v[i]];

    }

    for(int i=size[x];i;i--)f[x][i]=min(g[x][i],f[x][i-]+c[x]-d[x]);

}

int main(){

    memset(first,-,sizeof(first));

    memset(f,0x3f,sizeof(f));

    memset(g,0x3f,sizeof(g));

    scanf("%d%d",&n,&k);

    for(int i=;i<=n;i++){

        scanf("%d%d",&c[i],&d[i]);

        if(i!=)scanf("%d",&fa[i]),add(fa[i],i);

    }dfs();

    for(int i=;i<=n;i++)if(f[][i]<=k)ans=i;

    printf("%d\n",ans);

}

//By SiriusRen

#include <cstdio>

#include <cstring>

#include <algorithm>

using namespace std;

const int N=;

typedef long long ll;

int n,a,b,c,minn[N*],maxx[N*],lazy[N*];

ll sum[N*],ans;

struct Node{int x,y,z;}node[N];

void setlazy(int num,int pos,int wei){sum[pos]=1ll*num*wei;maxx[pos]=minn[pos]=lazy[pos]=wei;}

void push_down(int l,int r,int pos){

    int mid=(l+r)>>,lson=pos<<,rson=lson|;

    setlazy(mid-l+,lson,lazy[pos]),setlazy(r-mid,rson,lazy[pos]);

    lazy[pos]=;

}

void push_up(int pos){

    int lson=pos<<,rson=lson|;

    sum[pos]=sum[lson]+sum[rson],minn[pos]=min(minn[lson],minn[rson]),maxx[pos]=max(maxx[lson],maxx[rson]);

}

void insert(int l,int r,int pos,int L,int R,int wei){

    if(wei<=minn[pos])return;

    if(lazy[pos])push_down(l,r,pos);

    if(l>=L&&r<=R&&maxx[pos]<=wei){setlazy(r-l+,pos,wei);return;}

    int mid=(l+r)>>,lson=pos<<,rson=pos<<|;

    if(mid<L)insert(mid+,r,rson,L,R,wei);

    else if(mid>=R)insert(l,mid,lson,L,R,wei);

    else insert(l,mid,lson,L,R,wei),insert(mid+,r,rson,L,R,wei);

    push_up(pos);

}

bool cmp(Node a,Node b){return a.x>b.x;}

int main(){

    scanf("%d%d%d%d",&n,&a,&b,&c);

    for(int i=;i<=n;i++){

        scanf("%d%d%d",&node[i].x,&node[i].y,&node[i].z);

        insert(,b,,,node[i].y,node[i].z);

    }sort(node+,node++n,cmp);

    for(int i=a,j=;i;i--){

        for(;j<=n&&node[j].x==i;j++)insert(,b,,,node[j].y,c),insert(,b,,,b,node[j].z);

        ans+=1ll*b*c-sum[];

    }printf("%I64d\n",ans);

}