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


void main() {
    int n;
    scan(n);

    foreach (i ; 0 .. n) {
        string s;
        scan(s);
        solve(s);
    }
}

void solve(string s) {
    auto a = [".,!? ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"];
    auto ss = s.group;
    string res;

    foreach (si ; ss) {
        if (si[0] == '0') continue;
        int d = si[0] - '0' - 1;

        res ~= a[d][(si[1]-1) % a[d].length];
    }

    writeln(res);
}


void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}