#include <bits/stdc++.h>   using namespace std;   long long a[1000006];   map<pair<long long, long long>, long long> mp;   int main() {     long long n, k;     cin >> n >> k;     if (k == 0 && n != 1) {       cout <<  No solution ;       return 0;     }     if (n == 1) {       cout << k;       return 0;     }     if (k != 1) {       cout << k - 1;       for (int i = 0; i < n - 2; i++) cout << 0;       cout << 1;       return 0;     }     if (k == 1) {       cout << 9;       for (int i = 0; i < n - 2; i++) cout << 0;       cout << 1;       return 0;     }     return 0;   }   