Go: package main

import "fmt"
import "strconv"

func main() {
  for i := 1; i <= 9; i++ {
    for j := 1; j <= 9; j++ {
      res := i * j
      fmt.Println(strconv.Itoa(i) + "x" + strconv.Itoa(j) + "=" + strconv.Itoa(res))
    }
  }
}

C++: int main() {
	
	for (int i = 1; i < 10; i++) {
		for (int b = 1; b < 10; b++) {
			cout << i<<"*"<<b<<"="<<i*b<<endl;
		}
	}

		return 1;
}

C++: #include <iostream>
using namespace std;

int main()
{
  for (int i = 1; i <= 9; ++i)
  {
    for (int j = 1; j <= 9; ++j)
    {
      printf("%dx%d=%d\n", i, j, i*j);
    }
  }
  return 0;
}

C++: #include <iostream>
using namespace std ;

int main()
{
	for( int i = 1 ; i <= 9 ; i ++ )
	{
		for( int j = 1 ; j <= 9 ; j ++ )
		{
			cout << i << "x" << j << "=" << (i*j) << "\n" ;
		}
	}

	return 0 ;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
typedef complex<double> P;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 29;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };


int main() {
#ifdef _DEBUG
	printf( "debug\n" );
#endif
	for ( int i = 1; i < 10; i++ ) {
		for ( int j = 1; j < 10; j++ ) {
			printf( "%dx%d= %d\n", i, j, i * j );
		}
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	for(int i=1;i<10;i++)
		for(int j=1;j<10;j++)
			cout<<i<<'x'<<j<<'='<<i*j<<endl;
	return 0;
}

C++: #include <cstdio>
int main(){
	for(int i=1;i<=9;i++){
		for(int j=1;j<=9;j++){
			printf("%dx%d=%d\n",i,j,i*j);
		}
	}
	return 0;
}

C++: i = 1
k = 1
while i < 10
    while k < 10
        t  = i * k
        puts "#{i}x#{k}=#{t}"
        k = k + 1
    end
    i = i + 1
    k = 1
end

C++: #include <iostream>
using namespace std;

int main(int argc, const char * argv[])
{

    for (int i=1; i<=9; i++) {
        for (int j=1; j<=9; j++) {
            cout << i << 'x' << j << '=' << i*j << endl;
        }
    }
    return 0;
}

C++: #include <iostream>

int main(void) {
    for (int i = 1; i <= 9; ++i) {
        for (int j = 1; j <= 9; ++j) {
            printf ("%dx%d=%d\n", i, j, i*j);
        }
    }

    return 0;
}

C++: 

#include <stdio.h>
int main()
{
    for(int i=1;i<10;i++)
    {
        for(int j=1;j<10;j++)
        {
            printf("%dx%d=%d\n",i,j,i*j);
        }
    }
    return 0;
}

C++: #include <iostream>

using namespace std;

int main(int argc, char const *argv[]) {
    for(int i = 0; i < 10; i ++){
      for(int j = 0; j < 10; j++){
        //printf("%dx%d=%d\n",i,j,i*j);
        cout << i << "x" <<  j << "=" << i*j << endl;
      }
    }
  return 0;
}

C++: #include<iostream>
#include<stdio.h>
int main(){
	int a,b;
		for(a=1;a<10;a++){
			for(b=1;b<10;b++){
				std::cout<<a<<"x"<<b<<"="<<a*b<<std::endl;
				}
			}


  
      return 0;
	}

C++: test

C++: #include<stdio.h>
int main(void){
    int i,j;
    for(i=1;i<=9;i++){
        for(j=1;j<=9;j++){
            printf("%dx%d=%d\n",i,j,i*j);
        }
    }
return 0;
}

C++: #include <iostream>

using namespace std;

int main(void){
	for (int i=1; i<=9; ++i){
		for (int j=1; j<=9; ++j){
			cout << i << "x" << j << "=" << i*j << endl;
		}
	}
	return 0;
}

C++: #include <iostream>
 
using namespace std;
 
int main(){
    for (int i = 1; i < 10; i++){
        for (int j = 1; j < 10; j++){
            cout << i << "x" << j << "=" << (i*j) << endl;
        }
    }
    return 0;
}

C++: #include <iostream>
using namespace std;

int main(void)
{
  int i = 0, j = 0;
  for(i = 1; i < 10; ++i) {
    for(j = 1; j < 10; ++j) {
      cout << i << "x" << j << "=" << (i * j) << endl;
    }
  }
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
for(int i=1;i<10;i++)
for(int j=1;j<10;j++)
cout<<i<<"x"<<j<<"="<<i*j<<endl;
}

C++: #include <stdio.h>
int main() {
  int i,j;
  for(i=0; i<9; i++)
    for(j=0; j<9; j++)
      printf("%dx%d=%d
",i+1,j+1,(i+1)*(j+1));
  return 0;
}

C++: #include <iostream>
using namespace std;
int main()
{
	
	for (int i=1; i<10; i++){
		for(int j=1; j<10; j++){

			cout << i << 'x' << j << '=' << i*j;


			cout << "\n";
		}

	

	
	}


return 0;

}

C++: #include <iostream>
using namespace std;

int main()
{
    for(int i=1;i<10;i++)
        for(int j = 1;j<10;j++)
            cout<<i<<"x"<<j<<"="<<i*j<<endl;

    return 0;
}

C++: # include <cmath>
# include <algorithm>
# include <iostream>
# include <cstring>
# define bignum 200000000
# define eps 1e-6
# define N 655
using namespace std;
int p;
struct Point
{
	int x,y;
}pt[N],pln[N];

int dlcmp(int x)
{
	return x<0?-1:x>0;
}
int cross(Point a,Point b,Point s)
{
	int x1=a.x-s.x,y1=a.y-s.y;
	int x2=b.x-s.x,y2=b.y-s.y;
	return x1*y2-x2*y1;
}
double dis(Point a,Point b)
{
	double dx=a.x-b.x;
	double dy=a.y-b.y;
	return sqrt( dx*dx + dy*dy );
}
int cmp(Point a,Point b)
{
	if (dlcmp(cross(a,b,pt[0]))==1 || 
		(dlcmp(cross(a,b,pt[0]))==0 && dis(pt[0],a)<dis(pt[0],b)) )
		return 1;
	else return 0;
}
int graham_scan(int n)
{
	int top,t,i;
	if (n<=1)
		return n;
	for (t=0,i=1;i<n;i++)
		if (dlcmp(pt[i].y-pt[t].y)==-1 || 
		(dlcmp(pt[i].y-pt[t].y)==0 && dlcmp(pt[i].x-pt[t].x)==-1))
				t=i;
	swap(pt[0],pt[t]);

	sort (pt+1,pt+n,cmp);
	for (i=0;i<2;i++)
		pln[i]=pt[i];
	top=2;
	for (i=2;i<n;i++)
	{
		while (top>1 && dlcmp(cross(pln[top-1],pt[i],pln[top-2]))<=0)
			top--;
		pln[top++]=pt[i];
	}
	return top;
}
int abss(int x)
{
	return x<0?-x:x;
}
inline int calc(int x,int y)
{
	return (abss(pt[x].x+pt[y].x)*abss(pt[x].y+pt[y].y))%p;
}
int dp[N][N];
int main (void)
{
	int n;
	while (cin>>n>>p)
	{
		for (int i=0;i<n;i++)
			cin>>pt[i].x>>pt[i].y;
		if (graham_scan(n)<n)
		{
			cout<<"I can't cut."<<endl;
			continue;
		}
		for (int i=n;i<n+n;i++)
			pt[i]=pt[i-n];
		memset(dp,0,sizeof(dp));
		for (int len=3;len<n;len++)
		{
			for (int i=0;i<n;i++)
			{
				int j=i+len;
				dp[i][j]=min(dp[i+1][j]+calc(i+1,j),dp[i][j-1]+calc(i,j-1));
				for (int k=i+2;k<=j-2;k++)
					dp[i][j]=min(dp[i][j],dp[i][k]+dp[k][j]+calc(i,k)+calc(j,k));
			}
		}
		int ans=bignum;
		for (int i=0;i<n;i++)
			ans=min(ans,dp[i][i+n-1]);
		cout<<ans<<endl;
	}
	
	return 0;
}

C++: #include<stdio.h>

int main(){
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
printf("%d×%d=%d\n",i,j,i*j);
}
}

    return 0;
}

C++: #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e9 + 7, MOD = 1e9 + 7;
const long long LINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
	for (int i = 1; i <= 9; i++) {
		for (int j = 1; j <= 9; j++) {
			cout << i << "x" << j << "=" << i * j << endl;
		}
	}
	return 0;
}

C++: #include <stdio.h>


int main()
{
	int a,b;
	for(a = 1; a < 10; a++){
		for(b = 1; b < 10; b++){
		printf("%dx%d=%d\n",a,b,a*b);
		}
	}
	return 0;
}