#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
using namespace std;
template <class T> void checkmin(T &t,T x) {if(x < t) t = x;}
template <class T> void checkmax(T &t,T x) {if(x > t) t = x;}
template <class T> void _checkmin(T &t,T x) {if(t==-1) t = x; if(x < t) t = x;}
template <class T> void _checkmax(T &t,T x) {if(t==-1) t = x; if(x > t) t = x;}
typedef pair <int,int> PII;
typedef pair <double,double> PDD;
typedef long long ll;
#define foreach(it,v) for(__typeof((v).begin()) it = (v).begin(); it != (v).end ; it ++)
ll a , b;
int cas = 1;
int wei(ll a) {int ans = 0;while(a) {a /= 10;ans ++;}checkmax(ans , 1);return ans;
}
int oowei(ll a) {int ans = 0;while(a) {if(a % 10 != 0) ans ++;a /= 10;}checkmax(ans , 1);return ans;
}
int main() {while(cin >> a >> b) {if(a + b == 0) break;printf("Problem %d\n",cas++);ll c = a * b;int Wa = wei(a) , Wb = wei(b) , Wc = wei(c);if(c == 0) {int dd = max(Wa , Wb);if(a != 0) cout << a << endl;else for(int i=1;i<dd;i++) putchar(' ');cout << a << endl;if(b != 0) cout << b << endl;else for(int i=1;i<dd;i++) putchar(' ');cout << b << endl;for(int i=0;i<dd;i++) putchar('-');puts("");for(int i=1;i<dd;i++) putchar(' ');cout << c << endl;continue;}int oWb = oowei(b);for(int i=0;i<Wc-Wa;i++) putchar(' ');cout << a << endl;for(int i=0;i<Wc-Wb;i++) putchar(' ');cout << b << endl;for(int i=0;i<Wc;i++) putchar('-');puts("");int cc = 0;ll ad = 0;while(b) {ll d = b%10;b /= 10;if(d == 0) { ad +=1; cc++; continue; }d *= a;ll Wd = wei(d);for(int i=0;i<Wc-Wd-cc;i++) putchar(' ');cout << d ;while(ad > 0) putchar('0') , ad -= 1;cout << endl;cc ++;}if(oWb > 1) {for(int i=0;i<Wc;i++) putchar('-');puts("");cout << c << endl;}}return 0;
}

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
using namespace std;
template <class T> void checkmin(T &t,T x) {if(x < t) t = x;}
template <class T> void checkmax(T &t,T x) {if(x > t) t = x;}
template <class T> void _checkmin(T &t,T x) {if(t==-1) t = x; if(x < t) t = x;}
template <class T> void _checkmax(T &t,T x) {if(t==-1) t = x; if(x > t) t = x;}
typedef pair <int,int> PII;
typedef pair <double,double> PDD;
typedef long long ll;
#define foreach(it,v) for(__typeof((v).begin()) it = (v).begin(); it != (v).end ; it ++)
int n , a , b , ans , cas = 1;
double tmp;
int main() {while(~scanf("%d",&n) && n) {tmp = -1.0;for(int i=0;i<n;i++) {scanf("%d%d",&a,&b);double tp = ((double)(a*a)) / ((double)b);if(tp > tmp) {ans = a; tmp = tp;}}printf("Menu %d: %d\n",cas++,ans);}return 0;
}

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
using namespace std;
template <class T> void checkmin(T &t,T x) {if(x < t) t = x;}
template <class T> void checkmax(T &t,T x) {if(x > t) t = x;}
template <class T> void _checkmin(T &t,T x) {if(t==-1) t = x; if(x < t) t = x;}
template <class T> void _checkmax(T &t,T x) {if(t==-1) t = x; if(x > t) t = x;}
typedef pair <int,int> PII;
typedef pair <double,double> PDD;
typedef long long ll;
#define foreach(it,v) for(__typeof((v).begin()) it = (v).begin(); it != (v).end ; it ++)
int main() {char ch[100100];bool vis[26];while(gets(ch)) {if(strcmp(ch,"END") == 0) break;int ok = 1;memset(vis,0,sizeof(vis));for(int i=0;ch[i];i++) {if(ch[i] == ' ') continue;int t = ch[i] - 'A';if(vis[t]) { ok=0;break; }vis[t] = 1;}if(ok) puts(ch);}return 0;
}