#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
struct modint {
    ll n;
    modint() :n(0) { ; }
    modint(ll m) :n(m) {
        if (n >= mod)n %= mod;
        else if (n < 0)n = (n % mod + mod) % mod;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 10;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}


void solve() {
    int n, k; cin >> n >> k;
    vector<int> a(n);
    rep(i, n) {
        cin >> a[i];
    }
    vector<vector<modint>> rsum(k + 1, vector<modint>(n + 1));
    rep(i, n) {
        modint p = 1;
        rep(j, k + 1) {
            rsum[j][i + 1] += rsum[j][i] + p;
            p *= a[i];
        }
    }
    rep1(x, k) {
        modint ans = 0;
        rep(j, x + 1) {
            ans += comb(x, j) * rsum[j][n] * rsum[x - j][n];
            ans -= comb(x, j) * rsum[x][n];
        }
        ans *= (1 + mod) / 2;
        cout << ans << "\n";
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(15);
    init_f();
    //init();
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}
/*

Konnichiwaa!!!!

*/


#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define REP(i, k, n) for(ll i = k; i < n; ++i)
#define REPI(i, k, n) for(ll i = k; i >= n; --i)
#define vi vector<int>
#define vch vector<char>
#define vstr vector<string>
#define vll vector<ll>
#define vb vector<bool>
#define vvi vector<vi>
#define vpl vector<pair<ll, ll>>
#define vpi vector<pair<int, int>>
#define F first
#define S second
#define el "\n"
#define sz(x) x.size()
#define ld long double
#define sortar(v) sort(v.begin(),v.end())
#define rsort(v) sort(v.rbegin(),v.rend())
#define all(x) x.begin(), x.end()
#define div 1000000007
#define div2 998244353
#define pi 3.14159265358979323846
#define inf 1000000000000000000
#define blk 455
#define pb push_back
#define ppb pop_back
#define print(x) for(auto p:x) cout<<p<<' '; cout<<el;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define mod 998244353
#define N 1000005
bool isPrime[N] = {false};
vll prm;
vll SPF(N);

void sieve()
{
    isPrime[1] = isPrime[0] = 0;
    ll i;
    
    for(i=2;i<N;++i) isPrime[i] = 1;

    for(i=2;i*i<N;++i)
    {
        if(isPrime[i])
        {
            for(ll j = i*i; j<N; j += i)
                isPrime[j] = 0;
        }
    }
    
    if(!prm.empty())
        prm.clear();

    REP(i,2,N)
    {
        if(isPrime[i])
            prm.pb(i);
    }
    
}

bool flip(bool f)
{
    if(f) return 0;
    return 1;
}
ll fastPower(ll a, ll b)
{
    if(b == 0) return 1;
    ll prod = 1;
    while(b > 0)
    {
        if(b & 1)
            prod = prod * a;
        b = b >> 1;
        a = a * a;
    }
    return prod;
}


ll fact(ll n) {
    ll res = 1;
    for(ll i=2;i<=n;i++) {
        res*=i;
    }
    return res;
}

ll nCr(ll n,ll r) {
    return (ld)fact(n)/(ld)(fact(r)*fact(n-r));
}

void printa(bool f){
    if(f) cout<<"YES"<<el;
    else cout<<"NO"<<el;
}

ll value(ll n){
    return (n*(n+1))/2;
}

void solve(){
    ll n, i;
    cin>>n;
    vector<pair<ll, ll>> a;
    REP(i,0,n){
        ll x, y;
        cin>>x>>y;
        a.pb(make_pair(x, y));
    }
    sort(all(a));
    
    ll j, k;
    
    REP(i,0,n){
        REP(j,i+1, n){
            REP(k,j+1,n){
                if(a[j].F != a[i].F && a[k].F != a[i].F){
                    double m1 = 1.0*(a[j].S - a[i].S)/(a[j].F - a[i].F);
                    double m2 = 1.0*(a[k].S - a[i].S)/(a[k].F - a[i].F);
                    if(m1==m2){
                        cout<<"Yes"<<el;
                        return;
                    }
                } else if(a[j].F == a[i].F && a[k].F == a[i].F){
                    cout<<"Yes"<<el;
                    return;
                }
            }
        }
    }
    cout<<"No"<<el;
}


int main()
{
    // fastio();
    #ifndef ONLINE_JUDGE 
    freopen("C:/Users/Lenovo/Desktop/inpOut/input.txt", "r", stdin); 
    freopen("C:/Users/Lenovo/Desktop/inpOut/output.txt", "w", stdout);
    #endif

    // ios_base::sync_with_stdio(0);
    // cin.tie(0);

    int tc = 1, i = 1;
    // scanf("%d", &tc);
    while(tc--)
    {
        // cout<<"Case #"<<i<<": ";
        solve();
        // ++i;
    }
    return 0;
}