#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<queue>
#define mem(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
using namespace std;
int max(int a,int b){ return a>b?a:b;}
int maxn (int a,int b,int c){return max(max(a,b),max(b,c));}
int min(int a,int b){return a<b?a:b;}
struct nmn {
int y,m,d,flag;
};
int cmp(nmn a,nmn b)
{
if(a.y!=b.y) return a.y<b.y;
else {
if(a.m!=b.m) return a.m<b.m;
return a.d<a.d;
}
}
int main()
{
int a,b,c,i;
char d,e;
scanf("%d%c%d%c%d",&a,&d,&b,&e,&c);
nmn node [7];
node[0].y=a;node[0].m=b;node[0].d=c;
node[1].y=c;node[1].m=b;node[1].d=a;
node[2].y=c;node[2].m=a;node[2].d=b;
for(i=0;i<3;i++)
{
if(node[i].y>59) node[i].y+=1900;
else node[i].y+=2000;
}
sort(node,node+3,cmp);
int month[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
for(i=0;i<3;i++)
{
if(node[i].m>12||node[i].m<1) node[i].flag=1;
else
{
if(((node[i].y% 4 == 0 && node[i].y% 100 != 0) || (node[i].y % 400 == 0))&&node[i].m==2) month[2]=29;
else month[2]=28;
if(node[i].d>month[node[i].m]||node[i].d<1) node[i].flag=1;
}
}
for(i=0;i<3;i++){
if(i!=0&&node[i].y==node[i-1].y&&node[i].m==node[i-1].m&&node[i].d==node[i-1].d) continue;
if(node[i].flag!=1)
printf("%02d-%02d-%02d\n",node[i].y,node[i].m,node[i].d);
}
return 0;
}
#include<string.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<queue>
#define mem(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
using namespace std;
int max(int a,int b){ return a>b?a:b;}
int maxn (int a,int b,int c){return max(max(a,b),max(b,c));}
int min(int a,int b){return a<b?a:b;}
struct nmn {
int y,m,d,flag;
};
int cmp(nmn a,nmn b)
{
if(a.y!=b.y) return a.y<b.y;
else {
if(a.m!=b.m) return a.m<b.m;
return a.d<a.d;
}
}
int main()
{
int a,b,c,i;
char d,e;
scanf("%d%c%d%c%d",&a,&d,&b,&e,&c);
nmn node [7];
node[0].y=a;node[0].m=b;node[0].d=c;
node[1].y=c;node[1].m=b;node[1].d=a;
node[2].y=c;node[2].m=a;node[2].d=b;
for(i=0;i<3;i++)
{
if(node[i].y>59) node[i].y+=1900;
else node[i].y+=2000;
}
sort(node,node+3,cmp);
int month[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
for(i=0;i<3;i++)
{
if(node[i].m>12||node[i].m<1) node[i].flag=1;
else
{
if(((node[i].y% 4 == 0 && node[i].y% 100 != 0) || (node[i].y % 400 == 0))&&node[i].m==2) month[2]=29;
else month[2]=28;
if(node[i].d>month[node[i].m]||node[i].d<1) node[i].flag=1;
}
}
for(i=0;i<3;i++){
if(i!=0&&node[i].y==node[i-1].y&&node[i].m==node[i-1].m&&node[i].d==node[i-1].d) continue;
if(node[i].flag!=1)
printf("%02d-%02d-%02d\n",node[i].y,node[i].m,node[i].d);
}
return 0;
}