import java.io.*;
import java.util.*;
import java.util.stream.*;

public class Main {
    static final int MOD = 998244353;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int q = sc.nextInt();
        UnionFindTree uft = new UnionFindTree(n);
        StringBuilder sb = new StringBuilder();
        while(q-- > 0) {
            HashMap<Character, Integer> sames = new HashMap<>();
            char[] inputs = sc.next().toCharArray();
            for (int i = 0; i < n; i++) {
                if (inputs[i] >= '0' && inputs[i] <= '9') {
                    uft.setNum(i, inputs[i] - '0');
                } else if (inputs[i] == '?') {
                    continue;
                } else {
                    if (sames.containsKey(inputs[i])) {
                        uft.unite(sames.get(inputs[i]), i);
                    } else {
                        sames.put(inputs[i], i);
                    }
                }
            }
            sb.append(uft.sum).append("\n");
        }
        System.out.print(sb);
    }
    
    static class UnionFindTree {
        int[] parents;
        int[] nums;
        long sum;
        static long BASE = pow(10, MOD - 2);

        public UnionFindTree(int size) {
            parents = new int[size];
            nums = new int[size];
            for (int i = 0; i < size; i++) {
                parents[i] = i;
                nums[i] = -1;
            }
            sum = pow(10, size);
        }
        
        public int find(int x) {
            if (x == parents[x]) {
                return x;
            } else {
                return parents[x] = find(parents[x]);
            }
        }
        
        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
        
        public void unite(int x, int y) {
            int xx = find(x);
            int yy = find(y);
            if (xx == yy) {
                return;
            }
            if (nums[xx] == -1) {
                parents[xx] = yy;
                sum *= BASE;
                sum %= MOD;
            } else if (nums[yy] == -1) {
                parents[yy] = xx;
                sum *= BASE;
                sum %= MOD;
            } else {
                parents[yy] = xx;
                if (nums[xx] != nums[yy]) {
                    sum = 0;
                }
            }
        }
        
        public void setNum(int x, int v) {
            int idx = find(x);
            if (nums[idx] == -1) {
                nums[idx] = v;
                sum *= BASE;
                sum %= MOD;
            } else if (nums[idx] != v) {
                sum = 0;
            }
        }
        
    }
    
    static long pow(long x, int p) {
        if (p == 0) {
            return 1;
        } else if (p % 2 == 0) {
            return pow(x * x % MOD, p / 2);
        } else {
            return pow(x, p - 1) * x % MOD;
        }
    }
}

class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}