#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long POW(long long a, long long b, long long MMM = MOD) {
  long long ret = 1;
  for (; b; b >>= 1, a = (a * a) % MMM)
    if (b & 1) ret = (ret * a) % MMM;
  return ret;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) {
  if (a == 0 || b == 0) return a + b;
  return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int ddx[] = {0, 0, 1, 1, 1, -1, -1, -1}, ddy[] = {1, -1, 1, 0, -1, 1, 0, -1};
char s[20];
int main() {
  int n;
  scanf("%d\n", &n);
  while (n--) {
    scanf("%s", s);
    int l = strlen(s + 4), x = stoi(s + 4);
    int t = 0, p = 10;
    for (int(i) = (1); (i) <= (l - 1); (i) += (1)) {
      t += p;
      p *= 10;
    }
    x += (1989 + t - x) / p * p;
    if (x < 1989 + t) x += p;
    printf("%d\n", x);
  }
}
