ZUFEOJ Home ProblemSet Source/Category Contest Status Ranklist F.A.Qs
Login Register

4769: International Olympiad

内存限制：256 MB 时间限制：2 S
题面：传统 评测方式：文本比较 上传者：
提交：2 通过：2
提交提交记录统计Web Board

题目描述

D. International Olympiad
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last digits of the current year. Organizers always pick an abbreviation with non-empty string y that has never been used before. Among all such valid abbreviations they choose the shortest one and announce it to be the abbreviation of this year's competition.
For example, the first three Olympiads (years 1989, 1990 and 1991, respectively) received the abbreviations IAO'9, IAO'0 and IAO'1, while the competition in 2015 received an abbreviation IAO'15, as IAO'5 has been already used in 1995.
You are given a list of abbreviations. For each of them determine the year it stands for.
Input
The first line of the input contains a single integer n (1≤n≤1000)− the number of abbreviations to process.
Then n lines follow, each containing a single abbreviation. It's guaranteed that each abbreviation contains at most nine digits.
Output
For each abbreviation given in the input, find the year of the corresponding Olympiad.
Examples
Input 
5
IAO'15
IAO'2015
IAO'1
IAO'9
IAO'0
Output 
2015
12015
1991
1989
1990
Input 
4
IAO'9
IAO'99
IAO'999
IAO'9999
Output 
1989
1999
2999
9999

输入样例 复制

输出样例 复制

分类标签