import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N;
string S;

void main() {
  const numCases = readln.chomp.to!int;
  foreach (caseId; 0 .. numCases) {
    S = readln.chomp;
    N = cast(int)(S.length);
    int a, b;
    foreach_reverse (i; 0 .. N) {
      if ('0' <= S[i] && S[i] <= '9') {
        a = i;
        b = i + 1;
        foreach_reverse (j; 0 .. i) {
          if (!('0' <= S[j] && S[j] <= '9')) {
            break;
          }
          a = j;
        }
        break;
      }
    }
    string ans;
    if (a < b) {
      char[] cs = S[a .. b].dup;
      int carry = 1;
      foreach_reverse (ref c; cs) {
        const x = (c - '0') + carry;
        c = '0' + x % 10;
        carry = x / 10;
      }
      ans = "";
      ans ~= S[0 .. a];
      if (carry) {
        ans ~= '0' + carry;
      }
      ans ~= cs;
      ans ~= S[b .. $];
    } else {
      ans = S;
    }
    writeln(ans);
  }
}